def binarysearch(alist,item):
first=0
last=len(alist)-1
found=False
while first<=last and not found:
midpoint=(first+last)//2
if alist[midpoint]==item:
found=True
else:
if item>alist[midpoint]:
first=midpoint+1
else:
last=midpoint-1
return found