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
]
.
Get Python in a Nutshell now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.