ArinaRaguzina

Untitled

Jan 25th, 2019
110
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.72 KB | None | 0 0
  1. program task23;
  2. var
  3. arr: array[0..9] of integer;
  4. i: integer;
  5.  
  6. procedure qsort(l,r: integer);
  7. var
  8. w, q, i, j: integer;
  9. begin
  10. i := l; j := r;
  11. q := arr[(l+r) div 2];
  12. repeat
  13. while (arr[i] < q) do inc(i);
  14. while (q < arr[j]) do dec(j);
  15. if (i <= j) then
  16. begin
  17. w:=arr[i];
  18. arr[i] := arr[j];
  19. arr[j] := w;
  20. inc(i);
  21. dec(j);
  22. end;
  23. until (i > j);
  24. if (l < j) then qSort(l,j);
  25. if (i < r) then qSort(i,r);
  26. end;
  27.  
  28. begin
  29. randomize();
  30. for i := 0 to 9 do begin
  31. arr[i] := random(101) - 50;
  32. write(arr[i], ' ');
  33. end;
  34. writeln;
  35.  
  36. qsort(0, 9);
  37.  
  38. for i := 0 to 9 do begin
  39. write(arr[i], ' ');
  40. end;
  41. end.
Advertisement
Add Comment
Please, Sign In to add comment