Pagini recente » Cod sursa (job #2466688) | Cod sursa (job #2396553) | Cod sursa (job #2701575) | Cod sursa (job #2449374) | Cod sursa (job #2512114)
#include <algorithm>
#include <iterator>
#include <fstream>
using namespace std;
void shell_sort (int *a, int n) {
int h, i, j, t;
for (h = n; h /= 2;) {
for (i = h; i < n; i++) {
t = a[i];
for (j = i; j >= h && t < a[j - h]; j -= h) {
a[j] = a[j - h];
}
a[j] = t;
}
}
}
int main(){
int a[500000],n,i;
ifstream fin("algsort.in");
ofstream fout("algsort.out");
fin>>n;for(i=0;i<n;i++)fin>>a[i];
shell_sort(a,n);
for(i=0;i<n;i++)
fout << a[i]<< " ";
return 0;
}