- Prepare
- All Platforms
- Programming
- Aptitude
- Syllabus
- Interview Preparation
- Interview Exp.
- Off Campus
- Prime Video
- Prime Mock

- Interview Experience
- Prime VideoNew
- Prime Mock
- Discussion Forum
- Nano Degree
- Prime Video
- Prime Mock

Please login

Prime

#### Prepinsta Prime

Video courses for company/skill based Preparation

(Check all courses)

Get Prime Video
Prime

#### Prepinsta Prime

Purchase mock tests for company/skill building

(Check all mocks)

Get Prime mock
# Binary Search in C++

## What is binary search in C++?

**Binary search is another searching algorithm in C++. It is also known as half interval search algorithm. It is efficient and fast searching algorithm. If we want to search any element in the list then the only condition required is that the elements in the list must be in sorted order. It works by repeatedly dividing in half the portion of the list that could contain the item, until you’ve narrowed down the possible locations to just one. **

## Working of binary search in C++

- The searching algorithm proceed when the list is is in sorted order either ascending or descending.
- Now divide the list into two halves.
- If the element is at the center stop searching.
- Else if the element is smaller then the last element of first half then further we will search in first half.
- And if the element is greater than the first element of second half then further we will search in second half.
- We will follow step 3 ,4 and 5 until our element is found.

## Steps to implement Binary Searching with C++

- In the given list, first we will find the middle of the list using formula M=(L+R)/2, where M is the index of middle element, L is the index of leftmost element and R is the index of rightmost element.
- If the element to be search is on the middle index then we will terminate the search as our element is found.
- Else we will check if the element is smaller then the middle element or greater then the middle element.
- If it is smaller then the middle element we will continue our search in first half.
- And if it greater then the middle element we will continue our search in second half.
- We will repeat all the previous steps until our element is found.

## Algorithm for Binary Search in C++

- while(low<=high)

mid=(low+high)/2; - if(a[mid]<search_element)

low=mid+1; - else if(a[mid]>search_element)

high=mid-1; - If found return index
- Else return -1

## C++ Program for Binary Search

#include <iostream>//Header file. using namespace std; int binarySearch(int[], int, int, int); int main() //Main function. { int arr[10] = {19, 26, 37, 53, 56, 61, 77, 82, 87, 91}; int search_element, location=-1; cout<<"Enter the element which you want to search: "; cin>>search_element; location = binarySearch(arr, 0, 9, search_element); if(location != -1) { cout<<"Search element found at"<<location<<" location"; //Printing the result. } else { cout<<"Search element not present"; } return 0; } int binarySearch(int a[], int left, int right, int search_element) { int middle; if(right >= left) { middle = (left + right)/2; if(a[middle] == search_element) //Checking if elemnet is present at middle. { return middle+1; } else if(a[middle] < search_element) //Checking if elemnet is present in greater half. { return binarySearch(a,middle+1,right,search_element); } else //Checking if elemnet is present in samller half. { return binarySearch(a,left,middle-1,search_element); } } return -1; }

Output: Enter the element which you want to search: 53 Search element found at 4 location

## Time Complexity

For Binary Search

## Best

O(1)

## Average

O(log n)

## Worst

O(log n)

## Space Complexity

O(1)

## Average Comparisions

Log(N+1)

Login/Signup to comment