Pagini recente » Cod sursa (job #1739303) | Cod sursa (job #102242) | Cod sursa (job #2078944) | Cod sursa (job #2343551) | Cod sursa (job #1281558)
#include <fstream>
using namespace std;
ifstream fin("algsort.in");
ofstream fout("algsort.out");
int v[500001],n,i;
int poz (int p , int u){
int i=p, j=u, ii=0, jj=-1 , aux;
while(i!=j){
if(v[i]>v[j]){
aux=v[i];v[i]=v[j];v[j]=aux;
aux=ii;
ii=-jj;
jj=-aux;
}
i+=ii; j+=jj;
}
return i;
}
void sorteaza(int p, int u){
if(p<u){
int k=poz(p,u);
sorteaza(p,k-1);
sorteaza(k+1,u);
}
}
int main(){
fin>>n;
for(i=1;i<=n;i++){
fin>>v[i];
}
sorteaza(1,n);
for(i=1;i<=n;i++){
fout<<v[i]<<" ";
}
return 0;
}