Advertisement
Guest User

Untitled

a guest
Apr 20th, 2019
103
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.58 KB | None | 0 0
  1. #include "problem_2.h"
  2.  
  3. int partition(int *Arr, int l, int r)
  4. {
  5. int i,j,x;
  6. x=Arr[l];
  7. i=l-1;
  8. j=r+1;
  9. while(1)
  10. {
  11. do
  12. j=j-1;
  13. while(Arr[j]>x);
  14. do
  15. i=i+1;
  16. while(Arr[i]<x);
  17. if(i<j){
  18. int aux=Arr[i];
  19. Arr[i]=Arr[j];
  20. Arr[j]=aux;
  21. }
  22. else
  23. return j;
  24. }
  25. }
  26. void QuickSort (int *Arr, int l, int r)
  27. {
  28. int q;
  29. if(l<r)
  30. {
  31. q=partition(Arr,l,r);
  32. QuickSort(Arr,l,q);
  33. QuickSort(Arr, q+1,r);
  34. }
  35. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement