added binary search algorithm

binarySearch.java

@@ -0,0 +1,23 @@
+class binarySearch{
+    public int findElement(int[]arr,int x){
+        int low = 0;
+        int high = arr.length;
+        while(low<=high){
+            int mid = low+(high-low)/2;
+            if(arr[mid]==x){
+                return mid;
+            }else if(arr[mid]>x){
+                high = mid-1;
+            }else{
+                low = mid+1;
+            }
+        }
+        return -1;
+    }
+     public static void main(String[] args) {
+        int[] arr = {1,2,3,4,5,6,7,8,9};
+        int n = arr.length;
+        int x = 5;
+    }
+
+}