@@ -0,0 +1,1178 @@
+public class BinarySearchRecursive %7B%0A %0A    public static int binarySearchRecursive(int%5B%5D sortedArray, int start, int end, int key) %7B%0A         %0A        if (start %3C end) %7B%0A            int mid = start + (end - start) / 2; %0A            if (key %3C sortedArray%5Bmid%5D) %7B%0A                return binarySearchRecursive(sortedArray, start, mid, key);%0A                 %0A            %7D else if (key %3E sortedArray%5Bmid%5D) %7B%0A                return binarySearchRecursiveR(sortedArray, mid+1, end , key);%0A                 %0A            %7D else %7B%0A                return mid;  %0A            %7D%0A        %7D%0A        return -(start + 1); %0A    %7D%0A %0A    public static void main(String%5B%5D args) %7B%0A         %0A        int%5B%5D array;%0A        %0A    Scanner in = new Scanner(System.in);%0A    System.out.println(%22Enter number of elements%22);%0A    n = in.nextInt(); %0A    array = new int%5Bn%5D;%0A %0A    System.out.println(%22Enter %22 + n + %22 integers%22);%0A %0A %0A    for (c = 0; c %3C n; c++)%0A      array%5Bc%5D = in.nextInt();%0A %0A    System.out.println(%22Enter value to find%22);%0Asearch = in.nextInt();%0A        int index = binarySearchRecursion(array,0,array.length,search);%0A        System.out.println(%22Found %22 + search +%22 at %22+index+%22 index%22);%0A    %7D%0A%7D%0A

Create BinarySearchRecursive.java