public static void HeapSort(int[] array)
        {
            int arrayLength = array.Length;

            //構建最大堆
            for (int i = arrayLength / 2 - 1; i >= 0; i--)
                Heapify(array, arrayLength, i);

            //依次取出堆頂元素，并重新調整堆
            for (int i = arrayLength - 1; i >= 0; i--)
            {
                //將堆頂元素與當前最后一個元素交換
                int temp = array[0];
                array[0] = array[i];
                array[i] = temp;

                //重新調整堆
                Heapify(array, i, 0);
            }
        }

        private static void Heapify(int[] arr, int n, int i)
        {
            int largest = i; //假設父節點最大
            int left = 2 * i + 1; //左子節點
            int right = 2 * i + 2; //右子節點

            //如果左子節點大于父節點，則更新最大值
            if (left < n && arr[left] > arr[largest])
                largest = left;

            //如果右子節點大于父節點和左子節點，則更新最大值
            if (right < n && arr[right] > arr[largest])
                largest = right;

            //如果最大值不是當前父節點，則交換父節點和最大值，并繼續向下調整堆
            if (largest != i)
            {
                int swap = arr[i];
                arr[i] = arr[largest];
                arr[largest] = swap;

                Heapify(arr, n, largest);
            }
        }

        public static void HeapSortRun()
        {
            int[] array = { 19, 27, 46, 48, 50, 2, 4, 44, 47, 36, 38, 15, 26, 5, 3, 99, 888, 0, -1 };
            Console.WriteLine("排序前數組：" + string.Join(", ", array));

            HeapSort(array);

            Console.WriteLine("排序后數組：" + string.Join(", ", array));
        }