Skip to main content

Browse the archive

Staging
v0.8.1
Revision 9274e2d0e9a07c20a9ee8ab8e79e7d0d037615c0 authored by Guido van Rossum on 26 April 1994, 07:35:17 UTC, committed by Guido van Rossum on 26 April 1994, 07:35:17 UTC 
Improved guesswork by Tim for continuations where the open bracket
 
is the last thing on the line.
1 parent 0ec5c5d
Raw File
bisect.py 
# 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
back to top