Write a Java program that: • Defines a string array with a length of 15. • Populates the array with random strings of varying lengths. • Sorts this array into lexicographical order using three sorting algorithms. • Merge sort • Quick sort • Radix sort • Tests these 3 sorting methods. • Provides a big-Oh characterization, in terms of n, of the running time of these three algorithms. ● Improve the merge sort so that the time complexity of the best case is O(N). Write a Java program that: • Defines an array of custom objects representing students, each with attributes like name, age, and GPA. • Populates the array with random student data. • Sorts this array based on GPA using three sorting algorithms. • Heap sort Shell sort • Bucket sort • Tests these 3 sorting methods. • Gives a big-Oh characterization, in terms of n, of the running time of these three algorithms. Improve the bucket sort so that the time complexity of the average case is O(N).

In Python:   Code two versions of Quicksort algorithms, one using the Lomuto method and one using the Hoare method. Clearly document your code so that it is clear how and why your algorithms are correct. For each of the two algorithms the output must be the following three items: the total numberof comparisons, the total number of swaps, and the total running time. Demonstrate your two Quicksort algorithms on the input array A= [2, 8, 7, 1, 3, 5, 6, 4].

Write a version of the bubble sort algorithm that sorts a list of integers in descending order. Namely, change the bubble sort method to sort the parameter array in descending order. Hint: Bubble sort: void bubbleSort(int array(1) { int size = array.length; boolean isChanged = false; for (int i = 0; i < size - 1; i++) isChanged = false; for (int j = 0; j < size . 1 . 1; j++) if (array(s) > array() + 1]) { int temp = array(s); array[3] . arrays + 1); array() + 1] = temp; is Changed = true; } if (isChanged) break;

def sorting(x, i, j) if j+1-i < 10 then  Mergesort(x, i, j); t1 = i + (j+1-i)/3 t2 = i + 2*(j+1-i)/3 Sorting(x, i, t2) Sorting(x, i, j) Sorting(x, i, t2) // x is an array, I and j are first and last indices of this part of the array // on k elements, takes O(k log k) time   worst case analysis?

Answer the given question with a proper explanation and step-by-step solution. java

In Python: Let n be a (large) positive integer of your choice. We want to know which of the two Quicksort algorithms methods (he Lomuto method and the Hoare method) is superior when sorting arrays containing n elements. To answer this question, you will run Quicksort on 10000 random permutations of [1,2,3, . . . , n], on each of your two Quicksort algorithms.

Java Quick Sort but make it read the data 10, 7, 8, 9, 1, 5 from a file not an array // Java implementation of QuickSort import java.io.*;    class GFG {        // A utility function to swap two elements     static void swap(int[] arr, int i, int j)     {         int temp = arr[i];         arr[i] = arr[j];         arr[j] = temp;     }        /* This function takes last element as pivot, places        the pivot element at its correct position in sorted        array, and places all smaller (smaller than pivot)        to left of pivot and all greater elements to right        of pivot */     static int partition(int[] arr, int low, int high)     {            // pivot         int pivot = arr[high];            // Index of smaller element and         // indicates the right position         // of pivot found so far         int i = (low - 1);            for (int j = low; j <= high - 1; j++) {                // If current element is smaller             // than the pivot             if…