Cod sursa(job #3286779)
| Utilizator | Data | 14 martie 2025 17:32:27 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.65 kb |
#include<fstream>
using namespace std;
ifstream cin("algsort.in");
ofstream cout("algsort.out");
int n,v[500005];
void qsort(int st,int dr){
int i,j,m;
if(st<dr){
m=st,i=st,j=dr;
int aux=v[m];
while(i<j){
while(i<j && v[m]<=v[j])
--j;
v[i]=v[j];
while(i<j && v[j]>=v[i])
i++;
v[j]=v[i];
}
v[i]=aux;
qsort(st,i-1);
qsort(i+1,dr);
}
}
int main()
{
cin>>n;
for(int i=1;i<=n;i++)
cin>>v[i];
qsort(1,n);
for(int i=1;i<=n;i++)
cout<<v[i]<<" ";
return 0;
}
