【愚公系列】2021年11月 C#版 数据结构与算法解析(插入排序-希尔排序)

/// 
/// 希尔排序
/// 
public class Program {

    public static void Main(string[] args) {
        int[] array = { 43, 69, 11, 72, 28, 21, 56, 80, 48, 94, 32, 8 };
        int[] gaps = { 5, 3, 1 };

        for (int i = 0; i < gaps.Length; i++) {
            ShellsSort(array, gaps[i]);
        }
        ShowSord(array);

        Console.ReadKey();
    }

    private static void ShowSord(int[] array) {
        foreach (var num in array) {
            Console.Write($"{num} ");
        }
        Console.WriteLine();
    }

    public static void ShellsSort(int[] array, int gap) {
        int length = array.Length;
        for (int i = 0; i < gap; i++) {
            for (int j = i + gap; j < length; j += gap) {
                if (j < length) {
                    if (array[j] < array[j - gap]) {
                        int sentinel = array[j];
                        int k = 0;
                        for (k = j - gap; k >= i && sentinel < array[k]; k -= gap) {
                            array[k + gap] = array[k];
                        }
                        array[k + gap] = sentinel;
                    }
                }
            }
        }
    }

}