Cod sursa(job #793370)
Utilizator | Data | 2 octombrie 2012 18:48:30 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
#include<fstream.h>
int a[1000000],i,j,n,aux;
int main()
{
ifstream f("algsort.in");
ofstream g("algsort.out");
f>>n;
for(i=1;i<=n;i++)
f>>a[i];
for(i=1;i<n;i++)
for(j=i+1;j<=n;j++)
if(a[i]>a[j])
{
aux=a[j];
a[j]=a[i];
a[i]=aux;
}
for(i=1;i<=n;i++)
g<<a[i]<<" ";
return 0;
}