Cod sursa(job #273675)
Utilizator | Data | 8 martie 2009 21:05:12 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include<fstream.h>
int main()
{unsigned long n,j,i,aux;
int a[10000];
ifstream f("algsort.in");
ofstream g("algsort.out");
f>>n;
for(i=1;i<=n;i++)
f>>a[i];
for(i=1;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=1;i<=n;i++)
g<<a[i]<<" ";
f.close();
g.close();
return 0;
}