Insertion sort:
It is simple to sort a set of integer number or character set using insertion algorithm. Let you have unsorted array A[] of 10 elements.
A[]={23, 17, 12, 25, 33, 14, 17, 26, 21, 19}
I am showing you first six elements sorting in below.
- 23, 17, 12, 25, 33, 14, 17, 26, 21, 19 [initially]
- 17, 23,12, 25, 33, 14, 17, 26, 21, 19 [key= A[1] or 17 according to previous line that was sorted in this line]
- 12, 17, 23, 25, 33, 14, 17, 26, 21, 19 [key= A[2] or 12 according to previous line]
- 12, 17, 23, 25, 33, 14, 17, 26, 21, 19 [key= A[3] or 25 according to previous line, but here after first comparison of 12 with previous element we see no need to sort ]
- 12, 17, 23, 25, 33, 14, 17, 26, 21, 19 [key=A[4] or 33 according to previous line, but here after first comparison of with previous element we see no need to sort ]
- 12, 14, 17, 23, 25, 33, 17, 26, 21, 19 and that’s way all elements are sorted.
You have seen that every time key is placed in proper location in the array. We have seen that before all elements of a key have already been sorted
|
