bisect — Easy Playground

Binary search and sorted-list insertion functions

Python Playground

import bisect

# Maintain sorted list
sorted_list = [1, 3, 5, 7, 9]
bisect.insort(sorted_list, 4)
bisect.insort(sorted_list, 6)
print(sorted_list)

# Find insertion point
print(bisect.bisect_left(sorted_list, 5))

Output

Click "Run" to execute your code

The bisect module is part of Python's standard library. Binary search and sorted-list insertion functions.

Challenge

Try modifying the code above to explore different behaviors. Can you extend the example to handle a new use case?

View all Easy examples for bisect