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;

Ad blocker interference detected!

Wikia is a free-to-use site that makes money from advertising. We have a modified experience for viewers using ad blockers

Wikia is not accessible if you’ve made further modifications. Remove the custom ad blocker rule(s) and the page will load as expected.