Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- int x[2000];
- int n;
- int poz(int p,int u)
- {
- int piv,aux,k;
- piv=x[p];
- while (p<u)
- {
- if (x[p]>x[u])
- {
- aux=x[p];
- x[p]=x[u];
- x[u]=aux;
- }
- if (x[p]==piv)
- u--;
- else p++;
- }
- k=p;
- return k;
- }
- void quick(int p,int u)
- {
- int k;
- if (p<u)
- {
- k=poz(p,u);
- quick(p,k-1);
- quick(k+1,u);
- }
- }
- int main()
- {
- cin>>n;
- for(int i=1; i<=n; i++)
- {
- cin>>x[i];
- }
- quick(1,n);
- for(int i=1; i<=n; i++)
- cout<<x[i]<<' ';
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement