Cod sursa(job #2122740)
| Utilizator | Data | 5 februarie 2018 14:08:05 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.48 kb |
#include<fstream>
using namespace std;
int main() {
ifstream in("algsort.in");
ofstream out("algsort.out");
int n;
in >> n;
int *x = new int[n];
for (int i = 0;i < n;++i)
in >> x[i];
for (int i = 0;i < n;++i) {
int min = x[i], poz = i;
for (int j = i;j < n;++j) {
if (x[j] < min) {
min = x[j];
poz = j;
}
}
if (min != x[i]) {
int aux = x[poz];
x[poz] = x[i];
x[i] = aux;
}
}
for (int i = 0;i < n;++i)
out << x[i] << " ";
}