PLEASE WHAT ARE THE OUTPUTS FOR THE FOLLOWING CODES? COURSE DATA structures

15. public static void sort (double[] list) { sort (list, list.length - 1); public static void sort (double[] list, int high) { if (high > 1) { // Find the largest number and its index int indexOfMax = 0; double max = list[0]; for (int i = 1; i max) { max = list[i]; indexOfMax = i; // Swap the largest with the last number in the list list[indexOfMax] = list[high]; list[high) = max; // Sort the remaining list sort (list, high - 1); 16. public static int recursiveBinarySearch (int[] list, int key){ int low = 0; int high = list.length - 1; return recursiveBinarySearch (list, key, low, high); public static int recursiveBinarySearch(int[] list, int key, int low, int high) { if (low > high) // The list has been exhausted without a match return -low - 1; // Return -insertion point - 1 int mid = (low + high) / 2; if (key