6. Program for binary search using recurison

#program for the binary search
def binary(seq,item,l,u):
      if l>u:
            return -55
      mid=int((l+u)/2)
      if item== seq[mid] :
            return(mid)
      elif item< seq[mid] :
            u=mid-1
            binary(seq,item,l,u)
      elif item> seq[mid] :
            l=mid+1
            binary(seq,item,l,u)
      else:
            print('you entered wrong number')
series=[5,10,12,15,22,28,44,78,89,99,121,143,178,199,231]
print('your series is:',series)
n=len(series)
number=int(input('enter the number from the series to be searched'))
result=binary(series,number,0,n-1)
if result < 0:
      print('you entered negative value')
if result>=0:
      print(number,'found at index',result)