# Implementation of Binary Search

Learn how to implement Binary Search through recursive and iterative approaches.

## We'll cover the following

## Binary Search implementation

There can be two ways to implement Binary Search: `recursive`

and `iterative`

.

We will look at the recursive approach first. In this, we basically ignore half of the elements after just one comparison.

- Compare the
`key`

with the middle element. - If the
`key`

matches with the middle element, return the`mid`

index. - Else if the
`key`

is greater than the`mid`

element, then the`key`

can only lie in the right half sub-array after the`mid`

element. So we recur for the right half. - Else (
`key`

is smaller) recur for the left half.

Look at the code below:

Level up your interview prep. Join Educative to access 80+ hands-on prep courses.