تالار گفتمان مانشت

1.
function insertionSort(array a)
2.
for i in 0 -> a.length - 2 do
3.
j = i + 1
4.
tmp = a[j]
5.
while j > 0 AND tmp > a[j-1] do //create a gap
6.
a[j] = a[j-1]
7.
j--
8.
a[j] = tmp