Cod sursa(job #1123487)
Utilizator | Data | 26 februarie 2014 08:43:17 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.66 kb |
#include<fstream>
using namespace std;
int n,a[500002],i,j,x,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-1;i++)
{for(j=i+1;j<=n;j++)
{if(a[i]>a[j])
{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;
}