Feature Request: Implement Insertion Sort Algorithm using C

[mdfarmansayeed]

🔖 Feature Description

Insertion Sort Algorithm Insertion sort is a simple sorting algorithm that works by iteratively inserting each element of an unsorted list into its correct position in a sorted portion of the list. It is like sorting playing cards in your hands. You split the cards into two groups: the sorted cards and the unsorted cards. Then, you pick a card from the unsorted group and put it in the right place in the sorted group.

📈 Benefits

• Simple and easy to implement.
• Stable sorting algorithm.
• Efficient for small lists and nearly sorted lists.
• Space-efficient as it is an in-place algorithm.

🛠️ Suggested Implementation (Optional)

No response

📷 Screenshots

No response

✔️ Checklist

• [X] I have checked the existing issues to avoid duplicates.
• [X] I have read and understood the Contributing Guidelines.
• [X] I have read and agree to the Code of Conduct.
• [X] I am a Hacktoberfest'24 contributor.
• [X] I am willing to work on this issue.

📝 Additional Notes (Optional)

pls assign this issue to me

[mdfarmansayeed]

@sudo-parnab pls merge the PR