Cod sursa(job #1327147)
Utilizator | Data | 26 ianuarie 2015 13:49:55 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <fstream>
using namespace std;
int v[500000];
int main()
{
ifstream f("algsort.in");
ofstream g("algsort.out");
int n,i,j,aux;
f>>n;
for(i=0;i<n;++i)
f>>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)
g<<v[i]<<' ';
return 0;
}