Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<bits/stdc++.h>
- using namespace std;
- int partition(int a[],int left,int right)
- {
- int x=a[right];
- int i=left-1;
- for(int j=left; j<right; j++)
- {
- if(a[j]<=x)
- {
- i++;
- swap(a[i],a[j]);
- }
- }
- swap(a[right],a[i+1]);
- return i+1;
- }
- void quicksort(int a[],int left,int right)
- {
- if(left<right)
- {
- int q=partition(a,left,right);
- quicksort(a,left,q-1);
- quicksort(a,q+1,right);
- }
- }
- int main()
- {
- int n;
- cin>>n;
- int a[n];
- for(int i=0; i<n; i++)
- {
- cin>>a[i];
- }
- quicksort(a,0,n-1);
- for(int i=0; i<n; i++)
- {
- cout<<a[i]<<" ";
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement