#include using namespace std; int BinSearch(int arr[],int beg, int end, int key){ if(beg > end){ return -1; } else{ int mid = beg + (end - beg) / 2; if(arr[mid] == key){ return mid; } else if(key < arr[mid]){ return BinSearch(arr,beg,mid-1,key); } else{ return BinSearch(arr,mid+1,end,key); } } } int main() { int arr[] = {1,2,3,4,5,6,7,8}; int n = sizeof(arr)/sizeof(arr[0]); int key; cout << "Enter the key to be searched: " << endl; cin >> key; int res = BinSearch(arr,0,n-1,key); (res == -1) ? cout << "Element is not present in array" : cout << "Element is present at index " << res; return 0; } Q: Remove Function in above algorithm
#include <iostream>
using namespace std;
int BinSearch(int arr[],int beg, int end, int key){
if(beg > end){
return -1;
}
else{
int mid = beg + (end - beg) / 2;
if(arr[mid] == key){
return mid;
}
else if(key < arr[mid]){
return BinSearch(arr,beg,mid-1,key);
}
else{
return BinSearch(arr,mid+1,end,key);
}
}
}
int main()
{
int arr[] = {1,2,3,4,5,6,7,8};
int n = sizeof(arr)/sizeof(arr[0]);
int key;
cout << "Enter the key to be searched: " << endl;
cin >> key;
int res = BinSearch(arr,0,n-1,key);
(res == -1) ? cout << "Element is not present in array"
: cout << "Element is present at index " << res;
return 0;
}
Q: Remove Function in above
Step by step
Solved in 2 steps with 2 images
