Lower bound & upper bound binary search in Python

This tutorial shows you how to adapt a typical binary search algorithm so that it instead looks for the first occurrence of an element (lower bound) or index after last occurrence (upper bound). Lower and upper bound search functions are useful when trying to insert an element while maintaining a sorted order, or when searching for the number of a particular element in a sorted list. Code written in Python 3.

Be sure to like, comment, and subscribe!