Cod sursa(job #2645529)
Utilizator | Data | 28 august 2020 20:08:04 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.55 kb |
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
int main() {
ifstream f("algsort.in");
int n;
vector<int> v;
f>>n;
for(int i=0;i<=n-1;i++)
f>>v[i];
for(int i=0;i<=n-2;i++) {
for (int j = i + 1; j <= n - 1; j++)
if (v[i] > v[j]) {
int aux = v[i];
v[i] = v[j];
v[j] = aux;
}
}
f.close();
ofstream fout("algsort.out");
for(int i=0;i<=n-1;i++)
fout<<v[i]<<" ";
fout.close();
return 0;
}