Maintains a sorted list by inserting a new element at the correct position without re-sorting the entire list.

Communicates the intent to keep a collection sorted after each insertion, useful for algorithms that require ordered data.

When you need to insert elements into a list that must remain sorted after each insertion, such as maintaining a leaderboard or processing streaming data in order.

Used in algorithms like insertion sort, online median calculation, scheduling, or any scenario where a sorted collection must be updated incrementally.

bisect.insort(sorted_list, item)

bisect.insort(sorted_list, item)

sorted_list item

• bisect insort sorted list item insert

• bisect.insort_left bisect.insort_right

Using bisect.insort on an unsorted list, which yields incorrect ordering. Confusing insort with insort_left/insort_right when stability matters. Forgetting to import bisect module.

bisect.insort_left (inserts left of existing equal elements) bisect.insort_right (inserts right of existing equal elements) bisect.bisect (only finds insertion point) list.sort() (re-sorts entire list)

Do not confuse with list.insert() which inserts at a specific index without maintaining order.

• bisect
• bisect_left
• bisect_right
• insort
• insort_left
• insort_right

bisect.insort uses binary search (O(log n)) to find the insertion point but insertion itself is O(n) due to shifting elements.

Signals that the programmer values maintaining sorted order efficiently after each insertion.

Think "insert into sorted list" when you see bisect.insort.

Part of Python's bisect module, which provides binary search utilities.

Use bisect.insort_left/right for stable insertion or bisect.insort with key parameter (Python 3.10+)