Create binary_search.cpp

binary_search.cpp

@@ -0,0 +1,45 @@
+// find middle term in the array, compare , 
+// if not equal, check size and move left or right accordingly
+
+#include <iostream>
+using namespace std;
+
+int binarySearch(int arr[],int size, int key){
+
+    int start = 0;
+    int end = size-1;
+
+    int mid= start + (end - start)/2;
+
+    while(start <= end){
+
+        if (arr[mid] == key){
+
+            return mid;
+        }
+
+        if (key > arr[mid]) {
+            start = mid + 1;
+        }
+        else{
+            end = mid - 1;
+        }
+
+    mid= start + (end - start)/2;
+    }
+
+    return -1;
+}
+
+
+int main(){
+
+    int even[6] = {2,4,6,8,12,18};
+    int odd[5] = {3,8,11,11,16};
+
+    int oddIndex = binarySearch( odd, 5, 11);
+
+    cout << "Index of 11 is " << oddIndex << "." << endl;
+
+    return 0;
+}