Merge pull request ashutosh97#68 from amcs1729/master

binary_search

Author: ashutosh97

binary_search/binary_search.txt

@@ -0,0 +1,3 @@
+Binary search
+
+Question- Given a sorted array of numbers and a number, find if the given number exists in the array in O(nlogn) time and O(1) space.

binary_search/bs.class

@@ -0,0 +1,7 @@
+#BlueJ class context
+comment0.target=bs
+comment1.params=arr\ n
+comment1.target=boolean\ binary_search(int[],\ int)
+comment2.params=args
+comment2.target=void\ main(java.lang.String[])
+numComments=3

binary_search/bs.ctxt

@@ -0,0 +1,29 @@
+class bs
+{
+    public boolean binary_search(int arr[], int n)
+    {
+        int right;int left; int mid;
+        right= arr.length;
+        left=0;
+        do{
+            mid= (right+left)/2;
+            if(arr[mid]==n)
+            return true;
+            if(arr[mid]>n)
+            right= mid-1;
+            else
+            left= mid+1;
+           }while((arr[mid]!=n)&&(left!=right));
+           return false;
+    }
+    public static void main(String args[])
+    {
+        bs obj = new bs();
+        int a[]={1,2,3,4,5};
+        int n= 5;
+        if(obj.binary_search(a,n))
+        System.out.println("Element found");
+        else
+        System.out.println("Element is not present");
+    }
+}