Изменения

<wikitex> InsertionSort(a) for i = 1..to n - 1:

while (j >= 0) && and (a[j] > a[j + 1]): swap(a[j], a[j + 1]) j = j - 1</wikitex>