Добавил:
Studfiles2
Опубликованный материал нарушает ваши авторские права? Сообщите нам.
Вуз:
Предмет:
Файл:Шпоры по МПиПА / Массивы / Сортировка / Сортировка методом пузырька / Pascal / Исходник / bubbleSort
.pas Program bubble_sort;
const
max = 10000;
type myArray = array[0..max] of integer;
var dimension, i : integer;
arr, sortArray : myArray;
function bubbleSort( var arr : myArray; const length : integer ) : myArray;
var i, j, item : integer;
begin
for i := 1 to length-1 do begin
for j := 0 to length - i - 1 do begin
if arr[j] > arr[j+1] then begin
item := arr[j];
arr[j] := arr[j+1];
arr[j+1] := item;
end;
end;
end;
bubbleSort := arr;
end;
begin
writeln('Bubble Sort.');
write('Enter array dimension: '); readln( dimension );
write('Enter '); write( dimension ); write(' elements: ');
for i := 0 to dimension-1 do
read(arr[i]);
sortArray := bubbleSort( 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.
const
max = 10000;
type myArray = array[0..max] of integer;
var dimension, i : integer;
arr, sortArray : myArray;
function bubbleSort( var arr : myArray; const length : integer ) : myArray;
var i, j, item : integer;
begin
for i := 1 to length-1 do begin
for j := 0 to length - i - 1 do begin
if arr[j] > arr[j+1] then begin
item := arr[j];
arr[j] := arr[j+1];
arr[j+1] := item;
end;
end;
end;
bubbleSort := arr;
end;
begin
writeln('Bubble Sort.');
write('Enter array dimension: '); readln( dimension );
write('Enter '); write( dimension ); write(' elements: ');
for i := 0 to dimension-1 do
read(arr[i]);
sortArray := bubbleSort( 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.