编写一个函数，以确定原始排序列表被旋转以获取给定列表的最小次数。我的代码怎么了？

Question

示例：通过旋转排序列表[0、2、3、4、5、6、9] 3次获得列表[5、6、9、0、2、3、4]。

这是我的代码 -

def count_rotations_binary(nums):
    lo = 0
    hi = len(nums)-1
    while lo <= hi:
        mid = (lo+hi)//2
        mid_number = nums[mid]
        print("lo:", lo, ", hi:", hi, ", mid:", mid, ", mid_number:", mid_number)
    if mid > 0 and nums[mid] < nums[mid-1]  :
            # The middle position is the answer
        return mid
    elif nums[mid] < nums[len(nums)-1] :
            # Answer lies in the left half
        hi = mid - 1  
    else:
            # Answer lies in the right half
        lo = mid + 1
    return 0
q = count_rotations_binary([9,10,11,1,4,6,7,8])
print(q)