Cod sursa(job #2277915)
Utilizator | Data | 7 noiembrie 2018 00:13:25 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 40 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.53 kb |
#include<fstream>
using namespace std;
ifstream cin("algsort.in");
ofstream cout("algsort.out");
int n,v[500005];
void quicksort(int s,int d){
if(d-s+1<=1) return;
int pivot=v[d],i,j=s;
for(i=s;i<d;i++){
if(v[i]<=pivot){
swap(v[i],v[j]);
++j;
}
}
swap(v[d],v[j]);
quicksort(s,j-1);
quicksort(j+1,d);
}
int main(){
cin>>n;
for(int i=1;i<=n;i++)
cin>>v[i];
quicksort(1,n);
for(int i=1;i<=n;i++)
cout<<v[i]<<' ';
}