What is Binary Search and How to implement in Python

In this tutorial, we will learn about the standard Binary search algorithm and will implement it in Python.

Binary Search in Python

This searching technique reduces the number of comparisons and hence save on processing time. It compares the element to be found with the middle element and then goes on further eliminating one half of the array; finally leading to the desired element at the middle position.

TIME COMPLEXITY of Binary Search:

Binary search in the worst case scenario would make log(n) comparisons; making the time required to be O(logn), where n is the number of elements in the array.


Binary Search takes constant space irrespective of the number of elements in the array taking the space required to be of the range O(1).

DISADVANTAGE of Binary Search:

The only downside of this algorithm is that it cannot work with unsorted arrays – the array should be sorted either in ascending or descending order.

Implementing Binary Search in Python

data_list=list(map(int , input().split()))
        print("Element found at ",mid)
    print("Element not found")

Input :

12 25 43 59 61 78 92

Output :

Element found at  1

Explanation :

Let us consider that the element, value has to be searched in a list that is sorted in ascending order. value if first compared with the middle element; if value is greater than the middle element, the second half of the list becomes new segment to be searched. If the value is less than the middle element, the first half of the list is scanned for the value.

The process is repeated till either the element is found or we are left with just one element in the list to be checked and the value is still not found.

That’s it! Hope you have understood the concept of Binary Search.

Feel free to ask any doubts regarding the algorithm in the comments section below.

Also, have a look at other posts too,

What is GitHub and How to push your code on GitHub ?

How to perform Insertion Sort in Python ?

Leave a Reply

Your email address will not be published. Required fields are marked *