Cod sursa(job #785020)
Utilizator | Data | 7 septembrie 2012 17:04:56 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include <fstream>
#include <algorithm>
using namespace std;
int v[500001],N,i;
int main()
{
ifstream fin("algsort.in");
ofstream fout("algsort.out");
fin>>N;
for(i=1;i<=N;i++)
fin>>v[i];
for(i=1;i<N;++i)
for(int j=i+1;j<=N;++j)
if(v[i]>v[j])
swap(v[i],v[j]);
for(i=1;i<=N;++i)
fout<<v[i]<<" ";
return 0;
}