pThe sorted side
starts with just the first element,
which is not necessarily the
smallest element.
[0][1][2][3][4][5]
Sorted
side
Unsorted
side
...like this.
However, in the
Selectionsort, the sorted side always contained the smallest elements of the
array. In the Insertionsort, the sorted side will be sorted from small to
large, but the elements in the sorted side will not necessarily be the
smallest entries of the array.
Because the sorted side does
not need to have the smallest entries, we can start by placing one element in
the sorted side--we don't need to worry about sorting just one element. But
we do need to worry about how to increase the number of elements that are in
the sorted side.
