Binary Search is a technique used to search element in a sorted list. In this article, we will looking at library functions to do Binary Search.
Finding first occurrence of an element.
bisect.bisect_left(a, x, lo=0, hi=len(a)) : Returns leftmost insertion point of x in a sorted list. Last two parameters are optional, they are used to search in sublist.
First occurrence of 4 is present at 2
Finding greatest value smaller than x.
Largest value smaller than 7 is at index 3
Finding rightmost occurrence
bisect.bisect_right(a, x, lo=0, hi=len(a)) Returns rightmost insertion point of x in a sorted list a. Last two parameters are optional, they are used to search in sublist.
Last occurrence of 4 is present at 3
Please refer Binary Search for writing your own Binary Search code.
- Bisect Algorithm Functions in Python
- Python Program for Binary Search (Recursive and Iterative)
- Meta Binary Search | One-Sided Binary Search
- Why is Binary Search preferred over Ternary Search?
- Linear Search vs Binary Search
- Interpolation search vs Binary search
- Python Program for Anagram Substring Search (Or Search for all permutations)
- Binary Search
- Binary Search in PHP
- Binary Search using pthread
- Variants of Binary Search
- Binary Search in Java
- The Ubiquitous Binary Search | Set 1
- Binary Search a String
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.