Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- using namespace std;
- void poz (int li,int ls,int&k,int a[])
- {
- int i=li,j=ls,aux,i1=0,j1=-1;
- while(i<j)
- {
- if(a[i]>a[j])
- {
- swap(a[i],a[j]);
- aux=i1;
- i1=-j1;
- j1=-aux;
- }
- i=i+i1;
- j=j+j1;
- }
- k=i;
- }
- int k;
- void quicksort(int li,int ls,int a[])
- {
- if(li<ls)
- {
- poz(li,ls,k,a);
- quicksort(li,k-1,a);
- quicksort(k+1,ls,a);
- }
- }
- 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