Cod sursa(job #332377)
Utilizator | Data | 17 iulie 2009 16:53:06 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <stdio.h>
int a[500000];
void swap(int& t1, int& t2)
{
int aux = t1;
t1 = t2;
t2 = aux;
}
int main()
{
freopen("algsort.in","r",stdin);
freopen("algsort.out","w",stdout);
int n;
scanf("%d",&n);
int i,j;
for (i =0;i<n;i++)
{
scanf("%d",&a[i]);
}
for (i=0;i<n-1;i++)
{
for (j=i+1;j<n;j++)
{
if (a[i]>a[j])
{
swap(a[i],a[j]);
}
}
}
for (i=0;i<n;i++)
{
printf("%d ", a[i]);
}
return 0;
}