def findInSortedList(something, alist):

  low = 0
  high = len(alist) - 1

  while (low <= high):
    middle = int((low+high)/2.0)
    printNow("Checking at: "+str(middle)+" low="+str(low)+" high="+str(high))
    if alist[middle]==something:
      return "Found it!"
    if alist[middle]<something:
      low = middle+1
    if alist[middle]>something:
      high = middle-1

  return "Not found"