Cod sursa(job #772107)
Utilizator | Data | 28 iulie 2012 12:31:07 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include<fstream.h>
int i,j,k,n,s,v[500010],q,max,aux,l;
ifstream f("algsort.in");
ofstream g("algsort.out");
int main()
{
f>>n;
for(i=1;i<=n;i++)
f>>v[i];
q=n;
for(j=1;j<=q;j++)
{
for(i=1;i<=q;i++)
{
if(v[i]>=max)
{
max=v[i];
l=i;
}
}
aux=v[q];
v[q]=max;
v[l]=aux;
q--;
max=0;
}
for(i=1;i<=n;i++)
g<<v[i]<<" ";
return 0;
}