cpython/Lib/bisect.py

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