InsertionSort : Pascal

program InsertionSort;
uses crt;
type arr = array [1..100] of integer;

var
ArrMain : arr;
i,n : integer;

procedure InsertionSort(pjg:integer;var TabInt : arr);
var
i,j,nilai : integer;
begin

for i := 1 to pjg do
begin
nilai := TabInt[i];
j:=i-1;
while ((j>0) AND (TabInt[j]>nilai)) do
begin
TabInt[j+1]:=TabInt[j];
j:=j-1;
end;
TabInt[j+1]:=nilai;
end;
end;

begin
clrscr;
write('Jumlah array : ');readln(n);
for i := 1 to n do
begin
write('Array ke-',i,' : ');
readln(ArrMain[i]);
end;

InsertionSort(n,ArrMain);
writeln;
for i:= 1 to n do
writeln('Array ke-',i,' : ',ArrMain[i]);
end.