└── Binary_Search_Implementation.c++


/Binary_Search_Implementation.c++:
--------------------------------------------------------------------------------
 1 | #include <iostream> 
 2 | #include <string>
 3 | using namespace std;
 4 | int binarySearch(int myarray[], int beg, int end, int key)
 5 | {
 6 | int mid;
 7 | if(end >= beg) {
 8 | mid = (beg + end)/2; if(myarray[mid] == key)
 9 | {
10 | return mid+1;
11 | }
12 | else if(myarray[mid] < key) {
13 | return binarySearch(myarray,mid+1,end,key);
14 | }
15 | else {
16 | return binarySearch(myarray,beg,mid-1,key);
17 | }
18 | }
19 | return -1;
20 | }
21 | int main ()
22 | {
23 | int myarray[10] = {5,8,10,13,21,23,25,43,54,75};
24 | int key, location=-1;
25 |  
26 | 
27 | cout<<"The input array is"<<endl; for(int i=0;i<10;i++){
28 | cout<<myarray[i]<<" ";
29 | }
30 | cout<<endl;
31 | cout<<"Enter the key that is to be searched:"; cin>>key; location = binarySearch(myarray, 0, 9, key);
32 | if(location != -1) {
33 | cout<<"Key found at location "<<location;
34 | }
35 | else {
36 | cout<<"Requested key not found";
37 | }
38 | }
39 | 


--------------------------------------------------------------------------------