Augment Binary Search algorithm

[cschuerc]

Binary search for an item is already implemented here. I would like to augment it by a binary search to "find the first element in a sorted list that is >= a given item" as this is also a frequent task to do. I am interested in your opinion on this.

[Scopula]

I do agree that it is a useful variant of binary search.

bisect docs have examples of how to achieve this with the bisect module (see: find_le and find_ge).
https://docs.python.org/3/library/bisect.html

[cclauss]

Sounds useful. Should we implement the full API of the bisect module?

bisect.bisect_left(a, x, lo=0, hi=len(a))
bisect.bisect_right(a, x, lo=0, hi=len(a))
bisect.bisect(a, x, lo=0, hi=len(a))
bisect.insort_left(a, x, lo=0, hi=len(a))
bisect.insort_right(a, x, lo=0, hi=len(a))
bisect.insort(a, x, lo=0, hi=len(a))