@@ -0,0 +1,1056 @@
+package search;%0A%0Apublic class BinarySearchRecursion %7B%0A%09%0A    public static boolean recursiveBinarySearch(int%5B%5D sortedArray, int start, int end, int key) %7B%0A        %0A        if (start %3C= end) %7B%0A            int mid = (start + end) /2;  %0A            if (key %3C sortedArray%5Bmid%5D) %7B%0A                return recursiveBinarySearch(sortedArray, start, mid - 1, key);%0A                 %0A            %7D else if (key %3E sortedArray%5Bmid%5D) %7B%0A                return recursiveBinarySearch(sortedArray, mid + 1, end , key);%0A                 %0A            %7D else %7B%0A                return true;   %0A            %7D%0A        %7D%0A        return false;  %0A    %7D%0A %0A    public static void main(String%5B%5D args) %7B%0A         %0A        int%5B%5D arr1 = %7B2,45,234,567,876,900,976,999%7D;%0A        boolean index = recursiveBinarySearch(arr1,0,arr1.length - 1,45);%0A        System.out.println(index);%0A        index = recursiveBinarySearch(arr1,0,arr1.length - 1,999);%0A        System.out.println(index);%0A        index = recursiveBinarySearch(arr1,0,arr1.length - 1,5);%0A        System.out.println(index);%0A    %7D%0A%0A%7D%0A

Create BinarySearchRecursion.java