Cod sursa(job #781955)
| Utilizator | Data | 25 august 2012 15:15:40 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.45 kb |
#include<fstream>
using namespace std;
int main()
{
ifstream fin("algsort.in");
ofstream fout("algsort.out");
int n,v[500005],x,y,N;
fin>>n;
N=n+1;
for(int i=1;i<=n;++i)
fin>>v[i];
for(int i=1;i<=n/2;++i)
{
--N;
y=x=i;
for(int j=i+1;j<=n;++j)
if(v[x]>v[j])
x=j;
swap(v[x],v[i]);
for(int j=n-i+1;j>=1;--j)
if(v[y]<v[j])
y=j;
swap(v[y],v[N]);
}
for(int i=1;i<=n;++i)
fout<<v[i]<<" ";
return 0;
}
