Algorithms for searching are added here, implemented in cpp language.

Author: caffeine-soul

searching/binary.cpp

@@ -0,0 +1,39 @@
+#include <iostream>
+using namespace std;
+
+int binarySearch(int arr[], int l, int r, int x) 
+{ 
+   if (r >= l) 
+   { 
+        int mid = l + (r - l)/2; 
+  
+        // If the element is present at the middle  
+        // itself 
+        if (arr[mid] == x)   
+            return mid; 
+  
+        // If element is smaller than mid, then  
+        // it can only be present in left subarray 
+        if (arr[mid] > x)  
+            return binarySearch(arr, l, mid-1, x); 
+  
+        // Else the element can only be present 
+        // in right subarray 
+        return binarySearch(arr, mid+1, r, x); 
+   } 
+  
+   // We reach here when element is not  
+   // present in array 
+   return -1; 
+} 
+  
+int main(void) 
+{ 
+   int arr[] = {2, 3, 4, 10, 40}; 
+   int n = sizeof(arr)/ sizeof(arr[0]); 
+   int x = 10; 
+   int result = binarySearch(arr, 0, n-1, x); 
+   (result == -1)? cout<< "Element is not present in array\n" 
+                 : cout<< "Element is present at index "<< result; 
+   return 0; 
+} 

searching/linear.cpp

@@ -0,0 +1,21 @@
+#include<iostream>
+using namespace std;
+
+int search(int arr[], int n, int x) 
+{ 
+    int i; 
+    for (i = 0; i < n; i++) 
+        if (arr[i] == x) 
+         return i; 
+    return -1; 
+} 
+int main()
+{
+int n, x;
+cout<<"size of the array\n";
+cin>>n;
+int arr[n];
+cout<<"value to bea searched\n";
+cin>>x;
+cout<<search(arr[],n,x);
+}