def binarySearch(aList,item): first = 0 last = len(aList)-1 found=False while firstitem: return binSearch(aList,item,first,midPoint-1,calls+1) return binSearch(aList,item,midPoint+1,last,calls+1) def search(aList,item): binSearch(aList,item,0,len(aList)-1,1)