Create insertionSort.c

[Veekshitha11]

Insertion sort is a simple and efficient sorting algorithm that builds a sorted array one element at a time. It works by iterating through an input list and for each element, inserting it into its correct position in the already sorted portion of the list.

Summary by Sourcery

New Features:

• Implement insertion sort algorithm in C.

[sourcery-ai]

Reviewer's Guide by Sourcery

This PR implements an insertion sort algorithm in C. The implementation includes a main sorting function, a utility function to print arrays, and a main function that demonstrates the usage. The sorting algorithm is implemented using a standard in-place insertion sort approach, where elements are iteratively inserted into their correct positions in the sorted portion of the array.

Class diagram for insertionSort.c

classDiagram
    class insertionSort {
        +void insertionSort(int arr[], int n)
        +void printArray(int arr[], int n)
        +int main()
    }
    note for insertionSort "This class represents the main functions in the insertionSort.c file, including the sorting algorithm and utility functions."

Loading

File-Level Changes

Change	Details	Files
Implementation of the insertion sort algorithm	Created the main sorting function that iteratively builds a sorted array Uses a key variable to store the current element being inserted Implements shifting of elements to make space for insertion Handles edge cases with array bounds checking	C/insertionSort.c
Added utility and demonstration code	Created a utility function to print array contents Implemented a main function with a sample array Added demonstration of sorting with before/after array printing	C/insertionSort.c

---

Tips and commands

Interacting with Sourcery

• Trigger a new review: Comment @sourcery-ai review on the pull request.
• Continue discussions: Reply directly to Sourcery's review comments.
• Generate a GitHub issue from a review comment: Ask Sourcery to create an
  issue from a review comment by replying to it.
• Generate a pull request title: Write @sourcery-ai anywhere in the pull
  request title to generate a title at any time.
• Generate a pull request summary: Write @sourcery-ai summary anywhere in
  the pull request body to generate a PR summary at any time. You can also use
  this command to specify where the summary should be inserted.

Customizing Your Experience

Access your dashboard to:

• Enable or disable review features such as the Sourcery-generated pull request
  summary, the reviewer's guide, and others.
• Change the review language.
• Add, remove or edit custom review instructions.
• Adjust other review settings.

Getting Help

• Contact our support team for questions or feedback.
• Visit our documentation for detailed guides and information.
• Keep in touch with the Sourcery team by following us on X/Twitter, LinkedIn or GitHub.

[sourcery-ai]

Hey @Veekshitha11 - I've reviewed your changes - here's some feedback:

Overall Comments:

• Consider adding input validation for the array pointer and size parameter in insertionSort() to handle edge cases safely.
• The sizeof(arr)/sizeof(arr[0]) calculation in main() will only work for local arrays. Consider making the array size explicit when the code is reused in other contexts.

Here's what I looked at during the review

• 🟢 General issues: all looks good
• 🟢 Security: all looks good
• 🟢 Testing: all looks good
• 🟢 Complexity: all looks good
• 🟢 Documentation: all looks good

---

Sourcery is free for open source - if you like our reviews please consider sharing them ✨

• X
• Mastodon
• LinkedIn
• Facebook

_{Help me be more useful! Please click 👍 or 👎 on each comment and I'll use the feedback to improve your reviews.}