Insertion Sort | Sorting Algorithm | C Language Programming

If you find our Education channel @ShailendraSrivastava useful and would like to support Quality Independent Digital Education
You may contribute via PayTm @ OR

Name: Shailendra Srivastava
Bank: ICICI Bank
Account No. 039901544165
IFSC CODE:- ICIC0000399
Branch:-SECTOR 54,GURGAON.
A small amount of Rs 10 even will motivate & of great help.
### Thanks in advance :).### Contact details:

Insertion sort is a simple sorting algorithm that builds the final sorted array (or list) one item at a time. It is much less efficient on large lists than more advanced algorithms such as quick sort, heap sort, or merge sort. However, insertion sort provides several advantages:

Algorithm for insertion sort

A graphical example of insertion sort. The partial sorted list (black) initially contains only the first element in the list. With each iteration one element (red) is removed from the input data and inserted in-place into the sorted list.
Insertion sort iterates, consuming one input element each repetition, and growing a sorted output list. At each iteration, insertion sort removes one element from the input data, finds the location it belongs within the sorted list, and inserts it there. It repeats until no input elements remain.

Sorting is typically done in-place, by iterating up the array, growing the sorted list behind it. At each array-position, it checks the value there against the largest value in the sorted list (which happens to be next to it, in the previous array-position checked). If larger, it leaves the element in place and moves to the next. If smaller, it finds the correct position within the sorted list, shifts all the larger values up to make a space, and inserts into that correct position.