procedure InsertionSort(var A: array of Integer); var i: Integer; j: Integer; tmp: Integer; begin for i:= 1 to high(A) do begin j:= i; tmp := A[i]; while (j > 0) and (A[j-1] > tmp) do begin A[j]:= A[j-1]; Dec(j); end; A[j]:= tmp; end; end;
Advertisement
2,929
pages
Insertion sort
Advertisement