Skip to main content

Browse the archive

Staging
v0.5.1
https://github.com/python/cpython
09 December 2020, 11:06:31 UTC
Revision 227a4232e6580891d3ee74b25888685a3c436fe2 authored by Guido van Rossum on 10 March 1995, 14:42:57 UTC, committed by Guido van Rossum on 10 March 1995, 14:42:57 UTC 
the usual
1 parent fc8a01f
Raw File
Tip revision: 227a4232e6580891d3ee74b25888685a3c436fe2 authored by Guido van Rossum on 10 March 1995, 14:42:57 UTC
the usual
Tip revision: 227a423
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