Binary Search in C++ – Just Tech Review

Here you will find out about Binary Search in C++. Binary Search is a calculation used to search for a component in an arranged cluster. In this calculation the focused on the component is a contrasted and centre component. On the off chance that the two components are equivalent, at that point position of the center component is returned and consequently focused on the component is found. On the off chance that the two components are inconsistent, at that point whenever focused on the component is less or more than centre component we dispose of the lower or upper half and the search proceeds by finding new centre component. Program for Binary Search in C++ #include using namespace std; int main() { int search(int [],int,int); int n,i,a[100],e,res; cout >n; cout >a[i]; } cout >e; res=search(a,n,e); if(res!=-1) cout a[m]) f=m+1; else l=m-1; } return -1; } Output How Many Elements:5 Enter Elements of Array in Ascending order 12 39 40 68 77 Enter element to search:40 Element found at position 3