added searching algorithm

youhaveme9 · youhaveme9 · commit f5f1113ee60b · 2021-01-11T18:34:51.000+05:30
diff --git a/searching/binary_search.cpp b/searching/binary_search.cpp
@@ -0,0 +1,45 @@
+# include <iostream>
+# include <string>
+using namespace std;
+
+int binarySearch(int arr[], int n, int key){
+    // getting both end of the array 
+    int s = 0;
+    int end = n;
+    int mid;
+    while(s<=end){
+        // finding middle index of array
+        mid = (s+end)/2;
+        if(arr[mid]==key){
+        //if key is found at middle
+            return mid;
+        }
+        else if(key<arr[mid]){
+            end = mid-1;
+        }
+        else{
+            s=mid+1;
+        }
+    }
+    //if key is not found in the array
+    return -1;
+}
+
+
+int main(){
+    int n, key,i;
+    cout<<"Enter the size of array"<<endl;
+    cin>>n;
+    int arr[n];
+    //input array 
+    //enter array in sorted manner
+    for(i=0;i<n;i++){
+        cin>>arr[i];
+    }
+    cout<<"Enter the key to search"<<endl;
+    cin>>key;
+    int index = binarySearch(arr, n, key);
+    string result = (index==-1)? "Number not found": "Found at "+to_string(index)+ " position";
+    cout<<result<<endl;
+    return 0;
+}
diff --git a/searching/linear_search.cpp b/searching/linear_search.cpp
@@ -0,0 +1,35 @@
+# include <iostream>
+using namespace std;
+
+int search(int arr2[], int n, int key){
+    for(int i=0; i<n; i++){
+        //comparing key to array values one by one
+        if(arr2[i]==key){
+            return i;
+        }
+    }
+    //if number is not found
+    return -1;
+}
+
+
+int main(){
+    int n;
+    cout<<"Enter the length of array"<<endl;
+    cin>>n;
+    int arr2[n];
+    for(int i=0; i<n;i++){
+        cin>>arr2[i];
+    }
+    int key;
+    cout<<"Enter the key to find in the array"<<endl;
+    cin>>key;
+    int result = search(arr2, n, key);
+    if(result==-1){
+        cout<<"Number is not present"<<endl;
+    }
+    else{
+        cout<<"Number is present at index "<<result<<endl;
+    }
+    return 0;
+}
