Cod sursa(job #814046)
| Utilizator | Data | 15 noiembrie 2012 19:51:54 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
#include<fstream>
#include<algorithm>
#define NMAX 500000
using namespace std;
ifstream in("algsort.in");
ofstream out("algsort.out");
int v[NMAX],n;
int main (void)
{
in>>n;
for(int i=0;i<n;++i)
in>>v[i];
in.close();
int a;
for ( int i=0; i<n-1; ++i )
for( int j=i+1; j<n; ++j )
if ( v[i] > v[j] )
{
a = v[i] ;
v[i] = v[j] ;
v[i] = a;
}
for(int i=0;i<n;++i)
out<<v[i]<<" ";
out.close();
return 0;
}
