/// <summary>
/// 希尔排序
/// </summary>
/// <param name="intArray"></param>
/// <param name="length"></param>
public static void ShellSort(int[] intArray, int length)
{
    int gap, i, j, temp;
    for (gap = length / 2; gap >= 1; gap = gap / 3+1)
    {
        for(i=gap;i<length;i++)
        {
            temp=intArray[i];
            for(j=i-gap;j>=0&&intArray[j]>temp;j-=gap)
                intArray[j+gap]=intArray[j];
            intArray[j+gap]=temp;
        }
        if(gap==1)
            break;
    }
}