quicksort.pas

Implementations of different methods of sorting: BinaryInsertions.pas BubbleSort.pas HeapSort.p

function part(l, r: integer) : integer;
var
    v, i, j, b: integer;

begin

    v := a[r];
    I := l - 1;
    j := r;

    repeat

        repeat dec(j) until (a[j] <= v) or (j = i + 1);
        repeat inc(i) until (a[i] >= v) or (i = j - 1);

           b := a[i];
        a[i] := a[j];
        a[j] := b;

    until i >= j;

    a[j] := a[i];
    a[i] := a[r];
    a[r] := b;
    part := i;

end;

procedure QuickSort(l, t: integer);
var
    i: integer;

begin
    if l < t then begin

        i := part(l, t);
        QuickSort(l, i - 1);
        QuickSort(i + 1, t);

    end;
end;

{ Array: A [1 .. n]; Call: QuickSort (1, n) }