Pagini recente » Cod sursa (job #2824955) | Monitorul de evaluare | Borderou de evaluare (job #2617081) | Borderou de evaluare (job #504806) | Cod sursa (job #3333147)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("algsort.in");
ofstream fout("algsort.out");
vector<int> v;
void shellSort(vector<int>& v, int n) {
for(int gap = n >> 1; gap >= 1; gap >>= 1) {
for(int i = gap; i < n; i++) {
int x = v[i];
int j = i;
while(j >= gap && v[j - gap] > x) {
v[j] = v[j - gap];
j -= gap;
}
v[j] = x;
}
}
}
int main() {
ios::sync_with_stdio(false);
int n;
fin >> n;
for(int i = 0, x; i < n; i++) {
fin >> x;
v.push_back(x);
}
shellSort(v, n);
for(const int& i: v) {
fout << i << " ";
}
fin.close();
fout.close();
return 0;
}