Cod sursa(job #3133083)
Utilizator | Data | 25 mai 2023 03:15:15 | |
---|---|---|---|
Problema | Sortare prin comparare | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("algsort.in");
ofstream g("algsort.out");
void sort(int v[], int n)
{
int i, j, k, temporar;
for (i = n / 2; i > 0; i /= 2)
{
for (j = i; j < n; j++)
{
temporar = v[j];
k;
for (k = j; k >= i && v[k - i] > temporar; k = k - i)
v[k] = v[k - i];
v[k] = temporar;
}
}
}
int main()
{
int v[500000], n;
f >> n;
for (int i = 0; i < n; i++)
f >> v[i];
sort(v, n);
for (int i = 0; i < n; i++)
g << v[i] << " ";
return 0;
}