Шпоры по МПиПА / Массивы / Сортировка / Сортировка с помощью прямого выбора / Pascal / Исходник / straightInsertionSort

Program straight_insertion_sort;
const
max = 10000;
type myArray = array[0..max] of integer;
var dimension, i : integer;
arr, sortArray : myArray;

function straightInsertionSort( var arr : myArray; const length : integer ) : myArray;
var i, j, k : integer;
item : integer;
begin
for i := 0 to length-2 do begin
item := arr[i];
k := i;
for j := i+1 to length-1 do begin
if arr[j] <= item then begin
k := j;
item := arr[k];
end;
end;
arr[k] := arr[i];
arr[i] := item;
end;
straightInsertionSort := arr;
end;

begin
writeln('Straight Insertion Sort.');
write('Enter array dimension: '); readln( dimension );
write('Enter '); write( dimension ); write(' elements: ');
for i := 0 to dimension-1 do
read(arr[i]);
sortArray := straightInsertionSort( arr, dimension );
write('Sorting array: ');
for i := 0 to dimension-1 do begin
write( sortArray[i] ); write(' '); end;
writeln;
writeln('Press any key to continue...');
readln;
readln;
end.