Cod sursa(job #3359780)
| Utilizator | Data | 3 iulie 2026 21:24:48 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 40 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
#include<fstream>
using namespace std;
ifstream fin("algsort.in");
ofstream fout("algsort.out");
int main() {
int n, v[500000];
fin >> n;
for(int i = 0; i < n; i++) {
fin >> v[i];
}
// Select Sort
for(int i = 0; i < n - 1; i++) {
int posMin = i;
for(int j = i + 1; j < n; j++) {
if(v[j] < v[posMin]) {
posMin = j;
}
}
int aux = v[posMin];
v[posMin] = v[i];
v[i] = aux;
}
for(int i = 0; i < n; i++) {
fout << v[i] << " ";
}
fout << "\n";
return 0;
}
