Java Merge Sort[ 4 85(good for sorted data)76946875406618]Quick Sort[47(not good if data is already sorted)65]44397780194945 * Insertion Sort (Efficient for growing with time)[55969716989649]Bubble Sort(Good for short vectors in place)[8115439280966]de

Merge Sort: Code: import java.util.Arrays; // Merge sort in Java class Main { // Merge two sub arrays L and M into array void merge(int array[], int p, int q, int r) { int n1 = q - p + 1; int n2 = r - q; int L[] = new int[n1]; int M[] = new int[n2]; // fill the left and right array for (int i = 0; i < n1; i++) L[i] = array[p + i]; for (int j = 0; j < n2; j++) M[j] = array[q + 1 + j]; // Maintain current index of sub-arrays and main array int i, j, k; i = 0; j = 0; k = p; // Until we reach either end of either L or M, pick larger among // elements L and M and place them in the correct position at A[p..r] // for sorting in descending // use if(L[i] >= <[j]) while (i < n1 && j < n2) { if (L[i] <= M[j]) { array[k] = L[i]; i++; } else { array[k] = M[j]; j++; } k++; } // When we run out of elements in either L or M, // pick up the remaining elements and put in A[p..r] while (i < n1) { array[k] = L[i]; i++; k++; } while (j < n2) { array[k] = M[j]; j++; k++; } } // Divide the array into two sub arrays, sort them and merge them void mergeSort(int array[], int left, int right) { if (left < right) { // m is the point where the array is divided into two sub arrays int mid = (left + right) / 2; // recursive call to each sub arrays mergeSort(array, left, mid); mergeSort(array, mid + 1, right); // Merge the sorted sub arrays merge(array, left, mid, right); } } public static void main(String args[]) { // created an unsorted array int[] array = { 4,85,94,68,76,75,40,66,18 }; Main ob = new Main(); // call the method mergeSort() // pass argument: array, first index and last index ob.mergeSort(array, 0, array.length - 1); System.out.println("Sorted Array:"); System.out.println(Arrays.toString(array)); }} Output: Quick sort: Code: import java.io.*; class GFG{ // A utility function to swap two elementsstatic 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 (arr[j] < pivot) { // Increment index of // smaller element i++; swap(arr, i, j); } } swap(arr, i + 1, high); return (i + 1);} /* The main function that implements QuickSort arr[] --> Array to be sorted, low --> Starting index, high --> Ending index */static void quickSort(int[] arr, int low, int high){ if (low < high) { // pi is partitioning index, arr[p] // is now at right place int pi = partition(arr, low, high); // Separately sort elements before // partition and after partition quickSort(arr, low, pi - 1); quickSort(arr, pi + 1, high); }} // Function to print an array static void printArray(int[] arr, int size){ for(int i = 0; i < size; i++) System.out.print(arr[i] + " "); System.out.println();} // Driver Codepublic static void main(String[] args){ int[] arr = {47,44,39,77,80,19,49,45,65}; int n = arr.length; quickSort(arr, 0, n - 1); System.out.println("Sorted array: "); printArray(arr, n);}} Output:Insertion Sort: Code: // Insertion sort in Java import java.util.Arrays; class InsertionSort { void insertionSort(int array[]) { int size = array.length; for (int step = 1; step < size; step++) { int key = array[step]; int j = step - 1; // Compare key with each element on the left of it until an element smaller than // it is found. // For descending order, change key<array[j] to key>array[j]. while (j >= 0 && key < array[j]) { array[j + 1] = array[j]; --j; } // Place key at after the element just smaller than it. array[j + 1] = key; } } // Driver code public static void main(String args[]) { int[] data = {55,96,97,16,98,96,49}; InsertionSort is = new InsertionSort(); is.insertionSort(data); System.out.println("Sorted Array in Ascending Order: "); System.out.println(Arrays.toString(data)); }} Output: Bubble Sort: Code: // Bubble sort in Java import java.util.Arrays; class Main { // perform the bubble sort static void bubbleSort(int array[]) { int size = array.length; // loop to access each array element for (int i = 0; i < size - 1; i++) // loop to compare array elements for (int j = 0; j < size - i - 1; j++) // compare two adjacent elements // change > to < to sort in descending order if (array[j] > array[j + 1]) { // swapping occurs if elements // are not in the intended order int temp = array[j]; array[j] = array[j + 1]; array[j + 1] = temp; } } public static void main(String args[]) { int[] data = { 81,15,43,92,80,96,6 }; // call method using class name Main.bubbleSort(data); System.out.println("Sorted Array in Ascending Order:"); System.out.println(Arrays.toString(data)); }} Output: