Heap Queue & Bisection

heapq_module.py

# heaps in standard list types with functions like heappush, heappop, and nsmallest

# Items are always removed by highest priority (lowest number) first.
a = []
heappush(a, 5)
heappush(a, 3)
heappush(a, 7)
heappush(a, 4)

# print(heappop(a), heappop(a), heappop(a), heappop(a))
# >>> 3 4 5 7

# bisect module’s functions, such as bisect_left, provide an efficient binary search 
# through a sequence of sorted items. The index it returns is the insertion point 
# of the value into the sequence.