Page "Insertion sort" Paragraph 18

# To perform an insertion sort, begin at the left-most element of the array and invoke Insert to insert each element encountered into its correct position.

The ordered sequence into which the element is inserted is stored at the beginning of the array in the set of indices already examined.

Each insertion overwrites a single value: the value being inserted.