希尔排序

亦凉 2021-09-17 00:14 394阅读 0赞

希尔排序：

![watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzQwMzIzMjU2_size_16_color_FFFFFF_t_70][]

![849589-20180331170017421-364506073.gif][]

class Program
        {
            static void Main(string[] args)
            {
                int[] array = { 4, 6, 34, 75, 43, 7, 356, 2 };
                ShellSort(array);
                
                for (int i = 0; i < array.Length; i++)
                {
                    Console.Write(array[i] + " ");
                }
    
                Console.ReadKey();
            }
    
            public static void ShellSort(int[] arr)//希尔排序
            {
                int d = arr .Length / 2;
                while (d >= 1)
                {
                    for (int i = 0; i < d; i++)
                    {
                        for (int j = i + d; j < arr .Length; j += d)
                        {
                            int temp = arr [j];//存储和其比较的上一个a[x];
                            int loc = j;
                            while (loc - d >= i && temp < arr [loc - d])//&&j-d>=i
                            {
                                arr [loc] = arr [loc - d];
                                loc = loc - d;
                            }
                            arr [loc] = temp;
                        }
                    }
                    //一次插入排序结束，缩小d的值
                    d = d / 2;
                }
            }
    
        }

![20181113153541470.png][]

[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzQwMzIzMjU2_size_16_color_FFFFFF_t_70]: /images/20210725/479620db9a2d416f91f16a6ad3597444.png
[849589-20180331170017421-364506073.gif]: /images/20210725/5507679028944396aed735766901e198.png
[20181113153541470.png]: /images/20210725/25a78b5bb5c347b5b0af734beb11c3f2.png