Based on C, C + +, sort of
no vote
// Hill sorting void ShellSort (int r [], int n) { int i; int d; int j; for (d = n / 2; d> = 1; d = d / 2) // increment d to direct insertion sort { for (i = d + 1; i <n; i ++) { r [0] = r [i]; // insert record scratch is for (j = i-d; j> 0 && r [0] <r [j]; j = j-d) r [j + d] = r [j]; // after recording position shift d r [j + d] = r [0]; } } for (i = 1; i <n; i ++) cout << r [i] << ""; cout << "\ n";