希尔排序

/// <summary>
    /// 希尔排序
    /// </summary>
    public class ShellSort
    {
        public static void Sort(int[] array)
        {
            //取增量
            int step = array.Length / 2;

            while (step >= 1)
            {
                //无须序列
                for (int i = step; i < array.Length; i++)
                {
                    var temp = array[i];

                    int j;

                    //有序序列
                    for (j = i - step; j >= 0 && temp < array[j]; j = j - step)
                    {
                        array[j + step] = array[j];
                    }
                    array[j + step] = temp;
                }
                step = step / 2;
            }
        }
    }