Showing content from http://svn.python.org/projects/python/tags/release101/Lib/bisect.py below:
# 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
RetroSearch is an open source project built by @garambo
| Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4