Cod sursa(job #1461489)
Utilizator | Data | 15 iulie 2015 20:04:41 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 0 |
Compilator | c | Status | done |
Runda | Arhiva educationala | Marime | 0.53 kb |
#include <stdio.h>
#include <stdlib.h>
int main()
{
FILE *fin,*fout;
fin=fopen("algsort.in","r");
fout=fopen("algsort.out","w");
int v[500000],n,p,i,u,max;
fscanf(fin,"%d",&n);
u=n-1;
for(i=0;i<n;i++)
{
fscanf("%d",&v[i]);
}
for (u=n-1;u>0;u--) {
max=v[0];
p = 0;
for ( i = 1; i <= u; i++ )
if ( v[i] > max ) {
max = v[i];
p = i;
}
v[p] = v[u];
v[u] = max;
}
for(i=0;i<n;i++)
{
fprintf(fout,"%d",v[i]);
}
return 0;
}