def binary_search( SORTEDLIST, number):
low=0
high=len( SORTEDLIST)
found=False
while(low<high) and found==False:
mid=(int) (low+high/2)
if SORTEDLIST[mid]==number:
print “Number found at”,mid
found=True
break
elif SORTEDLIST[mid]<number:
low=mid+1
else:
high=mid-1
if low >= high:
print “Number not found”
maxrange = inputfEnter Count of numbers: ”)
numlist = []
for i in range(0, maxrange):
numlist.append(input(“?”))
numlist.sort()
print “Sorted list”,numlist
number = inputfEnter the number”)
binary_search(numlist,number)