The Insertionsort Algorithm
pIn this example, the new element goes in front of the element that was already in the sorted side.
[0]       [1]        [2]       [3]        [4]       [5] 
Sorted side
Unsorted side
After the insertion, the sorted side contains two elements. These two elements are in order from small to large, although they are not the smallest elements in the array.