Binary Search in Python
The following notebook demonstrates how to implement a binary search function(also knows as half interval) in Python. Some other related topics you might be interested in are Bubble sort in Python, Linear search in Python, and Sets and operations with sets in Python. The Binary Search in Python is among the topics covered in detail in the 365 Data Science Program
Who is it for
This free Jupyter Notebook template is geared towards Machine Learning Engineers, Bi Developers, Data Scientists, Data Analysts, and Data Architects.
How it can help you
This algorithm is far more efficient that the linear search one and is based on the assumption that the list is already sorted. It resembles the way people search for words in dictionaries which are ordered alphabetically. This template can be used as an example of the implementation for bubble sort.