Binary Search

 Binary Search - Algorithm

#include<iostream>

using namespace std;

int  main()

{

 int n;

 cout<<"Enter Size : "<<endl;

 cin>>n;

 int arr[n];

 cout<<"Enter Element : "<<endl;

 for(int i=0; i<n; i++)

    cin>>arr[i];

 int key;

 cout<<"Search : ";

 cin>>key;

 bool isFound = false;

 int i=0;

 int r=n-1;

 while(i<=r)

 {

     int m= 1+(r-1)/2;

     if(key == arr[m]){

        isFound = true;

        break;

     }

     else if(arr[m]<key)

       int l = m+1;

     else

        r = m-1;

 }

 if(isFound)

    cout<<"Found";

 else

    cout<<"Not found";

}