Cod sursa(job #2076882)
| Utilizator | Data | 27 noiembrie 2017 12:34:26 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#include <fstream>
using namespace std;
ifstream in("algsort.in");
ofstream out("algsort.out");
int v[500002], n, minim, c;
int main()
{
in >> n;
for(int i = 0; i < n; i++) {
in >> v[i];
}
for(int i = 0; i < n; i++) {
minim = i;
for(int j = i+1; j < n; j++) if(v[j] < v[minim]) minim = j;
c = v[minim];
v[minim] = v[i];
v[i] = c;
}
for(int i = 0; i < n; i++) {
out << v[i] << " ";
}
return 0;
}
