Cod sursa(job #1647089)
Utilizator | Data | 10 martie 2016 18:58:05 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <fstream>
using namespace std;
ifstream f("algsort.in");
ofstream g("algsort.out");
int x[500001];
int main()
{
int n,i,j,aux;
f>>n;
for(i=1;i<=n;i++)
f>>x[i];
for(i=1;i<n;i++)
for(j=i+1;j<=n;j++)
if(x[i]>x[j])
{
aux=x[i];
x[i]=x[j];
x[j]=aux;
}
for(i=1;i<=n;i++)
g<<x[i]<<" ";
return 0;
}