### Question:
LearnSort { private static int getPivot(@NotNull int[] array, int low, int high) { int pivotValue = array[low]; while (low < high) { while (low < high && array[high] >= pivotValue) { high--; } array[low] = array[high]; while (low < high && array[low] <= pivotValue) { low++; } array[high] = array[low]; } array[low] = pivotValue; return low; }  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 testGetPivot() throws Exception { }