Pagini recente » Borderou de evaluare (job #2486577) | Cod sursa (job #2297648) | Cod sursa (job #3321147) | Borderou de evaluare (job #2971812) | Cod sursa (job #3339989)
// https://www.infoarena.ro/problema/algsort
#include <bits/stdc++.h>
using namespace std;
ifstream in("algsort.in"); //algsort
ofstream out("algsort.out");
int main() {
int N; in >> N;
vector<int> v(N);
for (int i = 0; i < N; i++) in >> v[i];
auto isInversion = [](const auto a, const auto b) {
return a > b;
};
auto sortare = [N, isInversion] (vector<int> &v) {
for (int i = 1; i < N; i++)
for (int j = i; j > 0 && isInversion(v[j-1], v[j]); j--)
swap(v[j-1], v[j]);
};
sortare(v);
for(int i = 0; i < N; i++) out << v[i] << " ";
return 0;
}