Cod sursa(job #3004830)
| Utilizator | Data | 16 martie 2023 17:18:57 | |
|---|---|---|---|
| Problema | Sortare prin comparare | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.57 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("algsort.in");
ofstream fout("algsort.out");
int n;
void shellsort(int * v, int gap){
while(gap){
for(int i = 0; i + gap < n; i++)
if(v[i] > v[i + gap])
swap(v[i], v[i + gap]);
gap /= 2;
}
}
int main()
{
int v[100];
fin >> n;
for(int i = 0; i < n; i++)
fin >> v[i];
shellsort(v, 1024);
for(int i = 0; i < n; i++)
fout << v[i] << " ";
fin.close();
fout.close();
return 0;
}
