希尔排序-C#

//<----------希尔排序--------
        public static void ShellSort(double[] args)
        {
            int count = args.Length;
            
            double temp;
            int gap = count / 2;
            while (gap > 0)
            {
                for (int i = 0; i < count - gap; i++)
                {
                    for (int j = i; j < count - gap; j = j + gap)
                    {
                        if (args[j] > args[j + gap]) //分组后的组内的两数比较
                        {
                            temp = args[j];
                            args[j] = args[j + gap];
                            args[j + gap] = temp;
                        }
                    }
                }
                gap /= 2;//增量gap变小
            }
        }
        //----------希尔排序----->