Binary_linaer_search.txt

#include <iostream>
using namespace std;

int linear_search(int *arr, int n,int key){
    for(int i =0;i<n;i++){
        if(key==arr[i]){
            return i;
        }
    }
}
int binary_search(int *arr, int n,int key){
    int s =0;
    int e = n-1;
    int mid = s + (e-s)/2;
    while(s<=e){
        if(key==arr[mid]){
            return mid;
        }
        if(arr[mid]<=key){
            s = mid+1;
        }
        else{
            e = mid-1;
        }
        mid = s + (e-s)/2;
    }
}
int main()
{
    int arr[5] = {5,6,7,8,10};
    int key = 8;
    int n = 5;
    
    int a = binary_search(arr, n ,key);
    cout<<a<<endl;

    return 0;
}