希尔排序(K&RC)

1.希尔排序:   //----K&RC

void shellSort(int iv[], int n)
{
int i, j, gap, temp;
 
for (gap = n / 2; gap > 0; gap /= 2)
for (i = gap; i != n; i++)
for (j = i - gap; j >= 0 && iv[j] > iv[j + gap]; j -= gap)
{
temp = iv[j];
iv[j] = iv[j + gap];
iv[j + gap] = temp;
}
}