def sum_range(a, low, high): low = func_bsearch.bsearch(a, low) high = func_bsearch.bsearch(a, high) i = high j = low total = 0 while i < j: total = total + a[i] i = i + 1 return total
def sum_range(a, low, high): x = func_bsearch.bsearch(a, low) total = 0 while x < len(a) and a[x] < high: total = total + a[x] x += 1 return total
def sum_range(a,q,l): p = func_bsearch.bsearch(a,q) total = 0 i = p while i < len(a) and a[i] < l: total = total + a[i] i = i + 1 return total
def count(a, q): x = func_bsearch.bsearch(a, q) y = func_bsearch.bsearch(a, q + 1) return y - x
def count(a,q): p = func_bsearch.bsearch(a,q) pp = func_bsearch.bsearch(a,q+1) return pp - p
def count(a, q): p = func_bsearch.bsearch(a, q) c = func_bsearch.bsearch(a, q + 1) return c - p
def count(a, q): n1 = func_bsearch.bsearch(a, q) n2 = func_bsearch.bsearch(a, q + 1) count = n2 - n1 return count
def contains(a, q): p = func_bsearch.bsearch(a, q) return p < len(a) and a[p] == q
def contains(a, q): index = func_bsearch.bsearch(a, q) return index <= (len(a) - 1) and q == a[index]