The Insertionsort Algorithm
pSometimes we are lucky and the new inserted item doesn't need to move at all.
[0]       [1]        [2]       [3]        [4]       [5] 
Sorted side
Unsorted side
Sometimes we are lucky and the newly inserted element is already in the right spot. This happens if the new element is larger than anything that's already in the array.