9. BINARY SEARCH:python program, to search a number without using recursion

def binsearch(ar,key):
    low=0
    high=len(ar)-1
    while low<=high:
        mid=int((low+high)/2)
        if key==ar[mid]:
            return mid
        elif key<ar[mid]:
            high=mid-1
        else:
            low=mid+1
    else:
        return-263256
#main program
ra=[12,36,45,58,65,95,99]
item=int(input('enter the number to be searched:-'))
res=binsearch(ra,item)
if res>=0:
    print(item,'found at index',res)
else:
    print('SORRY',item,'NOT FOUND IN ARRAY')