Cod sursa(job #2463798)
Utilizator | Morar Cosmin Andrei CosminMorar | Data | 28 septembrie 2019 12:59:11 |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.54 kb |
#include <fstream>
using namespace std;
ifstream f("algsort.in");
ofstream g("algsort.out");
int n, i, j, aux, minn, pos;
int main()
{
f >> n;
int v[n+1];
for(i = 1; i <= n; i++)
f >> v[i];
for(i = 1; i < n; i++) {
minn = v[i];
for(j = i; j <= n; j++) {
if(v[j] < minn) {
minn = v[j];
pos = j;
}
}
v[pos] = v[i];
v[i] = minn;
}
for(i = 1; i <= n; i++)
g << v[i] << ' ';
return 0;
}