Python再帰で二分検索を実現

data=[1,3,5,6,7,9]
#min:       
#max:       
#data:   
#key:      
#                
def search(min,max,data,key):
    mid=(min+max)//2
    if mid==0:
        return mid
    elif data[mid]>key:
        print("   ")
        return search(0,mid-1,data,key)
    elif data[mid]