希尔排序

void ShellSort(int a[], int n)
{
    int d, i, j, temp;
    for(d = n/2; d >= 1; d = d/2)
    {
        for(i = d; i < n; i++)
        {
            temp = a[i];
            for(j = i - d; (j >= 0) && (a[j] > temp); j = j-d)
            {
                a[j + d] = a[j];
            }
            a[j + d] = temp;
        }
    }
}

引用地址： http://baike.baidu.com/view/178698.htm