Cod sursa(job #1279974)
Utilizator | Data | 1 decembrie 2014 11:44:15 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include <fstream>
using namespace std;
ifstream fin ("algosort.in");
ofstream fout ("algosort.out");
int main() {
int i, j, n, aux, a[500001];
fin >> n;
for(i = 0;i < n; i++) {
fin >> a[i];
}
for (i = 0; i < n - 1; i++) {
for (j = i + 1; j < n; j++) {
if (a [j] < a [i]) {
aux = a [i];
a [i] = a [j];
a [j] = aux;
}
}
}
for (i = 0; i < n; i++) {
fout << a [i] << " ";
}
return 0;
}