Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- int partition (int arr[], int l, int h)
- {
- int p=arr[l];
- int i=l+1,j=h;
- while(i<=j)
- {
- while(arr[i]<=p)i++;
- while(arr[j]>p)j--;
- if(i<=j)swap(arr[i],arr[j]);
- }
- swap(arr[l],arr[j]);
- return j;
- }
- void quicksort(int arr[],int l,int h)
- {
- if(l<h)
- {
- int pi=partition(arr,l,h);
- quicksort(arr,l,pi-1);
- quicksort(arr,pi+1,h);
- }
- }
Add Comment
Please, Sign In to add comment