Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include "problem_2.h"
- int partition(int *Arr, int l, int r)
- {
- int i,j,x;
- x=Arr[l];
- i=l-1;
- j=r+1;
- while(1)
- {
- do
- j=j-1;
- while(Arr[j]>x);
- do
- i=i+1;
- while(Arr[i]<x);
- if(i<j){
- int aux=Arr[i];
- Arr[i]=Arr[j];
- Arr[j]=aux;
- }
- else
- return j;
- }
- }
- void QuickSort (int *Arr, int l, int r)
- {
- int q;
- if(l<r)
- {
- q=partition(Arr,l,r);
- QuickSort(Arr,l,q);
- QuickSort(Arr, q+1,r);
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement