Cod sursa(job #429212)
| Utilizator | Data | 29 martie 2010 22:23:58 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.37 kb |
#include<stdio.h>
int main(){
long n, v[500001], i, j, aux;
freopen("algsort.in", "rt", stdin);
scanf("%ld", &n);
for(i=1; i<=n; i++)
scanf("%ld", &v[i]);
for(i=1; i<=n; i++)
{
aux=v[i];
for(j=i-1; j>0 && v[j]>aux; j--)
v[j+1]=v[j];
v[j+1]=aux;
}
freopen("algsort.out", "wt", stdout);
for(i=1; i<=n; i++)
printf("%ld ", v[i]);
return 0;
}