Simple Recursive python binary search

HOLc-42.py

import random

def binarySearch(sortedArray: list, searchFor, prevMiddle = 0) ->int:
  middle = int(len(sortedArray)/2)
  if(sortedArray[middle] == searchFor):
    return prevMiddle + middle
  elif(sortedArray[middle] < searchFor):
    #should keep a track of left index of array
    prevMiddle += middle
    return binarySearch(sortedArray[middle:], searchFor, prevMiddle)
  else:
    return binarySearch(sortedArray[:middle], searchFor, prevMiddle)
    

test = [1,2,3,4,5,6,7,8,9,10,11]
lookingFor = random.choice(test) 
result = binarySearch(test, lookingFor)
print('result key = ' + str(result))
assert test[result] == lookingFor, "The search is broken"