Cod sursa(job #772117)
Utilizator | avram andrei marius avram | Data | 28 iulie 2012 12:41:04 |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include<stdio.h>
int i,j,k,n,s,v[500010],q,max,aux,l;
int main()
{
freopen("algsort.in","r",stdin);
freopen("algsort.out","w",stdout);
scanf("%d",&n);
for(i=1;i<=n;i++)
scanf("%d",&v[i]);
q=n;
max=-11;
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=-1;
}
for(i=1;i<=n;i++)
printf("%d ",v[i]);
return 0;
}