java  Given Array : ARRAY[] = [11, 21, 33, 40, 50] Write a full and complete recursive implementation of the Binary Search Algorithm such that you find your target element 21 in O(log2(n)) time complexity overall and O(1) space complexity. Here, n is the length of the list of input integers (array). We will not be considering any memory used by recursion.

Write a program to implement insertion sort and also test this using an unsorted array in java

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…