Staging
v0.5.1
v0.5.1
Revision 399502c0ba39f545fcdf6230e2e163961c655480 authored by cvs2svn on 09 October 1997, 23:32:24 UTC, committed by cvs2svn on 09 October 1997, 23:32:24 UTC
1 parent 9a513ef
bisect.py
# Bisection algorithms
# Insert item x in list a, and keep it sorted assuming a is sorted
def insort(a, x, lo=0, hi=None):
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)
# Find the index where to insert item x in list a, assuming a is sorted
def bisect(a, x, lo=0, hi=None):
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
![swh spinner](/static/img/swh-spinner.gif)
Computing file changes ...