递归二分查找

1def binary_search_recursive(arr, left, right, target):
2    if left > right:
3        return -1
4    mid = (left + right) // 2
5    if arr[mid] == target:
6        return mid
7    if arr[mid] < target:
8        return binary_search_recursive(arr, mid + 1, right, target)
9    return binary_search_recursive(arr, left, mid - 1, target)