Question

How to implement the bubble sort algorithm in Pascal

Answer 1

program BubbleSort;

uses SysUtils;

procedure BubbleSort(var arr: array of Integer);
var
  size, i: Integer;
  swapped: Boolean;
begin
  size := Length(arr);
  swapped := True;

  while swapped do
  begin
    swapped := False;
    for i := 1 to size - 1 do
    begin
      if arr[i - 1] > arr[i] then
      begin
        arr[i - 1] := arr[i - 1] + arr[i];
        arr[i] := arr[i - 1] - arr[i];
        arr[i - 1] := arr[i - 1] - arr[i];
        swapped := True;
      end;
    end;
    size := size - 1;
  end;
end;

var
  arr: array[0..9] of Integer = (3, 14, 4, 1, 5, 90, 2, 6, 89, 7);
  i: Integer;

begin
  BubbleSort(arr);
  
  Write('Sorted array: ');
  for i := 0 to High(arr) do
  begin
    Write(arr[i], ' ');
  end;
  Writeln;
end.



(*
run:

Sorted array: 1 2 3 4 5 6 7 14 89 90 

*)

 

70+ SQL courses for beginners and professionals