Cod sursa(job #617076)
| Utilizator | Data | 13 octombrie 2011 21:25:56 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.42 kb |
#include<stdio.h>
long long a[500000], n;
int main()
{
freopen("algsort.in", "r", stdin);
freopen("algsort.out", "w", stdout);
long long i, t, aux;;
scanf("%d", &n);
for(i=1;i<=n;i++)
scanf("%d", &a[i]);
t=0;
while(t==0)
{
t=1;
for(i=1;i<n;i++)
if(a[i]>a[i+1])
{
aux=a[i];
a[i]=a[i+1];
a[i+1]=aux;
t=0;
}
}
for(i=1;i<=n;i++)
printf("%d ", a[i]);
return 0;
}
