Python in a Nutshell

Name

bisect

Synopsis

bisect(seq,item,lo=0,hi=sys.maxint)

Returns the index i into seq where item should be inserted to keep seq sorted. In other words, i is such that each item in seq [:i ] is less than or equal to item, and each item in seq [ i :] is greater than or equal to item. seq must be a sorted sequence. For any sorted sequence seq, seq [bisect( seq,y )-1]== y is equivalent to y in seq, but faster if len( seq ) is large. You may pass optional arguments lo and hi to operate on the slice seq [ lo:hi ].