public static void Main()
int[] arr = new int[]{5, 2, 7, 4, 6, 1, 3};
Console.WriteLine(HeapSort(arr, n, 7 ));
public static int HeapSort(int[] arr, int n, int k)
for (int i = n / 2 - 1; i >= 0; i--)
for (j= n - 1; j >= k; j--)
public static void Heapify(int[] arr, int n, int r)
if (li < n && arr[largest] < arr[li])
if (ri < n && arr[largest] < arr[ri])
Heapify(arr, n, largest);