Cod sursa(job #1017278)
Utilizator | Data | 27 octombrie 2013 16:53:04 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <iostream>
#include<fstream>
using namespace std;
ifstream fin("algsort.in");
ofstream fout("algsort.out");
int main()
{int i,j,aux,n;
long int v[500001];
fin>>n;
for(i=1;i<=n;i++)
fin>>v[i];
for(i=1;i<n;i++)
for(j=i+1;j<=n;j++)
if(v[i]>v[j])
{
aux=v[j];
v[j]=v[i];
v[i]=aux;
}
for(i=0;i<n;i++)
{
fout<<v[i]<<" ";
}
return 0;
}