Cod sursa(job #445867)
| Utilizator | Data | 24 aprilie 2010 13:29:18 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.38 kb |
#include<cstdio>
using namespace std;
#define Nmax 500001
int main()
{
int n,a[Nmax],i,aux,j;
freopen("algsort.in","r",stdin);
freopen("algsort.out","w",stdout);
scanf("%d",&n);
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[j]<a[i])
{aux=a[i];
a[i]=a[j];
a[j]=aux;
}
for(i=0;i<n;i++)
printf("%d ",a[i]);
return 0;
}
