0
0
mirror of https://github.com/python/cpython.git synced 2024-12-13 03:45:42 +08:00
cpython/Lib/bisect.py
Guido van Rossum 4e16098ce7 Added a _v21 def to FL.py and added two new input field types
Added runcall(func, *args) interfaces to profile.py, bdb.py, pdb.py, wdb.py
Added new module bisect.py and used it in sched.py.
Mostly cosmetic changes to profile.py (changed output format).
1992-09-02 20:43:20 +00:00

24 lines
458 B
Python

# Bisection algorithms
# Insert item x in list a, and keep it sorted assuming a is sorted
def insort(a, x):
lo, hi = 0, len(a)
while lo < hi:
mid = (lo+hi)/2
if x < a[mid]: hi = mid
else: lo = mid+1
a.insert(lo, x)
# Find the index where to insert item x in list a, assuming a is sorted
def bisect(a, x):
lo, hi = 0, len(a)
while lo < hi:
mid = (lo+hi)/2
if x < a[mid]: hi = mid
else: lo = mid+1
return lo