Cod sursa(job #881571)
Utilizator | Data | 18 februarie 2013 11:50:06 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include<fstream>
using namespace std;
int main()
{ifstream in("algsort.in");
ofstream out("algsort.out");
int n,v[500000],i,j,aux;
in>>n;
for(i=0;i<n;i++)
in>>v[i];
for(i=0;i<n-1;i++)
for(j=i+1;j<n;j++)
if(v[i]>v[j])
{aux=v[i];
v[i]=v[j];
v[j]=aux;
}
for(i=0;i<n;i++)
out<<v[i]<<" ";
return 0;
}