@@ -0,0 +1,783 @@
+class Salmonrice_Binary_Search%7B%0A    public static void main(String%5B%5D args) %7B%0A%0A        int arr%5B%5D = %7B1,2,3,4,5,6,7,8,9%7D;%0A        System.out.println(%225 is at index : %22+runBinarySearchRecursively(arr, 5, 1, 9));%0A    %7D%0A%0A%0A    public static int runBinarySearchRecursively(int%5B%5D sortedArray, int key, int low, int high) %7B%0A        int middle = low  + ((high - low) / 2);%0A%0A        if (high %3C low) %7B%0A            return -1;%0A        %7D%0A%0A        if (key == sortedArray%5Bmiddle%5D) %7B%0A            return middle;%0A        %7D else if (key %3C sortedArray%5Bmiddle%5D) %7B%0A            return runBinarySearchRecursively(%0A                    sortedArray, key, low, middle - 1);%0A        %7D else %7B%0A            return runBinarySearchRecursively(%0A                    sortedArray, key, middle + 1, high);%0A        %7D%0A    %7D%0A%0A%0A%7D

add java binary search