Lecture Notes on 24 Mar 2017

def seq_search (a, x):
  for i in range (len(a)):
    if (x == a[i]):
      return i
  return -1

def binary_search (a, x):
  lo = 0
  hi = len(a) - 1
  while (lo <= hi):
    mid = (lo + hi) // 2
    if (x < a[mid]):
      hi = mid - 1
    elif (x > a[mid]):
      lo = mid + 1
    else:
      return mid
  return -1