Skip to main content

Browse the archive

Staging
v0.5.1
https://github.com/python/cpython
09 December 2020, 11:06:31 UTC
Revision 8c1688e132c42db3ffa39faa7920be8f131cd74e authored by Guido van Rossum on 14 March 1995, 17:43:02 UTC, committed by Guido van Rossum on 14 March 1995, 17:43:02 UTC 
add dummy base to atoi/atol; careful about negative start indices in find/count
1 parent 55d2f39
Raw File
Tip revision: 8c1688e132c42db3ffa39faa7920be8f131cd74e authored by Guido van Rossum on 14 March 1995, 17:43:02 UTC
add dummy base to atoi/atol; careful about negative start indices in find/count
Tip revision: 8c1688e
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