Skip to main content

Browse the archive

Staging
v0.8.1
Revision 95fdec4073be430933e3d2639235431985eea7e4 authored by Fred Drake on 09 October 2000, 21:26:12 UTC, committed by Fred Drake on 09 October 2000, 21:26:12 UTC 
This file is no longer used.
1 parent 46446d6
Raw File
bisect.py 
"""Bisection algorithms."""


def insort(a, x, lo=0, hi=None):
    """Insert item x in list a, and keep it sorted assuming a is sorted."""
    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)


def bisect(a, x, lo=0, hi=None):
    """Find the index where to insert item x in list a, assuming a is sorted."""
    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
back to top