bisect

Bisection algorithms.

Functions

bisect((a, x[, lo[, hi]]) -> index)	bisect_right(a, x[, lo[, hi]]) -> index
bisect_left((a, x[, lo[, hi]]) -> index)	Return the index where to insert item x in list a, assuming a is sorted.
bisect_right	bisect(a, x[, lo[, hi]]) -> index
insort(a, x[, lo[, hi]]) insort_right(a, x[, ...)	Insert item x in list a, and keep it sorted assuming a is sorted.
insort_left(a, x[, lo[, hi]])	Insert item x in list a, and keep it sorted assuming a is sorted.
insort_right(a, x[, lo[, ...)	Insert item x in list a, and keep it sorted assuming a is sorted.