File: bisect.py

package info (click to toggle)
python 1.5.2-10potato11
  • links: PTS
  • area: main
  • in suites: potato
  • size: 13,340 kB
  • ctags: 36,680
  • sloc: ansic: 97,117; python: 88,266; makefile: 2,518; lisp: 2,363; sh: 882
file content (25 lines) | stat: -rw-r--r-- 480 bytes parent folder | download | duplicates (4) 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
 
# 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