Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- program task23;
- var
- arr: array[0..9] of integer;
- i: integer;
- procedure qsort(l,r: integer);
- var
- w, q, i, j: integer;
- begin
- i := l; j := r;
- q := arr[(l+r) div 2];
- repeat
- while (arr[i] < q) do inc(i);
- while (q < arr[j]) do dec(j);
- if (i <= j) then
- begin
- w:=arr[i];
- arr[i] := arr[j];
- arr[j] := w;
- inc(i);
- dec(j);
- end;
- until (i > j);
- if (l < j) then qSort(l,j);
- if (i < r) then qSort(i,r);
- end;
- begin
- randomize();
- for i := 0 to 9 do begin
- arr[i] := random(101) - 50;
- write(arr[i], ' ');
- end;
- writeln;
- qsort(0, 9);
- for i := 0 to 9 do begin
- write(arr[i], ' ');
- end;
- end.
Advertisement
Add Comment
Please, Sign In to add comment