searching algos done for now

searching_algos/binary_search.cpp

@@ -1,22 +1,21 @@
 int binary_search(int arr[],int size, int key)
 {
-    int low = 0;
+    int low, mid  = 0;
     int high = size - 1;
-
     while(low <= high)
     {
-      mid = low + (high - low) / 2;
-      // start from here
+        mid = low + (high - low) / 2;
+        if(arr[mid] == key)
+        return mid;
+
         if(key < arr[mid])
         {
-            high = mid;
-            mid = low + high / 2;
+            high = mid - 1;
         }
-        else if(key > arr[mid])
+        else
         {
-            low = mid;
-            mid = low + high / 2;
+            low = mid + 1;
         }
     }
-    return (arr[mid] == key) ? mid : -1;
+    return -1;
 }

searching_algos/linear_search.cpp

@@ -0,0 +1,9 @@
+int linear_search(int arr[],int size, int key)
+{
+    for(int i = 0; i < size; i++)
+    {
+        if(arr[i] == key)
+        return i;
+    }
+    return -1;
+}