Insertion Sort Homework Help
Insertion Sort Example:
Figure shows the actual procedure of INSERTION-SORT on the array A = (5, 2, 4, 6, 1, 3). Each part shows what happens for a particular iteration with the value of j indicated. j indexes the "current card" being inserted into the hand.
figure row by row. Elements to the left of A[j] that are more than A[j] move one position to the right and A[j] moves into the evacuated position.
