### Question:
LearnSort { private static void maxHeapify(int index, int[] array) { int parentIdx = index >> 1; for (; parentIdx >= 0; parentIdx--) { if (parentIdx << 1 >= index) { continue; } int left = parentIdx * 2; int right = (left + 1) >= index ? left : (left + 1); int maxChildId = array[left] >= array[right] ? left : right; if (array[maxChildId] > array[parentIdx]) { swap(maxChildId, parentIdx, array); } } }  static int[] insertSort(int[] array); static int[] shellSort(int[] array); static int[] selectionSort(int[] array); static int[] heapSort(int[] array); static int[] bubbleSort(@NotNull int[] array); static int[] quickSort(@NotNull int[] array); static int[] mergingSort(int[] array); static int[] radixSort(@NotNull int[] arr); final static int[] originalArray; }### Answer:
@Test public void testMaxHeapify() throws Exception { }