Staging
v0.8.1
v0.8.1
Revision 36d4f8b0ecc33a6ce09783bd39dea9a8b4c191a5 authored by Guido van Rossum on 10 April 2000, 21:34:37 UTC, committed by Guido van Rossum on 10 April 2000, 21:34:37 UTC
1 parent e110dcf
bisect.py
"""Bisection algorithms."""
def insort(a, x, lo=0, hi=None):
"""Insert item x in list a, and keep it sorted assuming a is sorted."""
if hi is None:
hi = len(a)
while lo < hi:
mid = (lo+hi)/2
if x < a[mid]: hi = mid
else: lo = mid+1
a.insert(lo, x)
def bisect(a, x, lo=0, hi=None):
"""Find the index where to insert item x in list a, assuming a is sorted."""
if hi is None:
hi = len(a)
while lo < hi:
mid = (lo+hi)/2
if x < a[mid]: hi = mid
else: lo = mid+1
return lo
Computing file changes ...