Cod sursa(job #1132507)
| Utilizator | Data | 3 martie 2014 15:47:22 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.55 kb |
#include <fstream>
#define NMax 500000
using namespace std;
int main()
{
ifstream fin("algsort.in");
ofstream fout("algsort.out");
int N, i, j, aux, v[NMax];
fin >> N;
for(i = 0 ; i < N ; ++i)
fin >> v[i];
for(i = 1 ; i < N ; ++i)
for(j = i + 1 ; j < N - 1 ; ++j)
if(v[i] > v[j])
aux = v[i], v[i] = v[j], v[j] = aux; // interschimba v[i] cu v[j]
for(i = 0 ; i < N ; ++i)
fout << v[i] << ' ';
fin.close();
fout.close();
return 0;
}
