python实现二分查找（递归、非递归）

本文用python3实现了二分查找算法，分别使用递归方法和非递归方法。

（一）递归实现

def binarySearch(s, k):
    return binarySearch_c(s, 0, len(s) - 1, k)


def binarySearch_c(s, low, high, k):
    if low > high:
        return -1
    mid = low + (high - low) // 2
    if s[mid] == k:
        return mid
    elif s[mid] > k:
        return binarySearch_c(s, low, mid - 1, k)
    else:
        return binarySearch_c(s, mid + 1, high, k)


for _ in range(int(input())):
    s = list(map(int, input().split()))
    k = int(input())
    print(binarySearch(s, k))

（二）非递归实现

def binarySearch(s, k):
    low = 0
    high = len(s) - 1
    while low <= high:
        mid = low + (high - low) // 2
        if s[mid] == k:
            return mid
        elif s[mid] > k:
            high = mid - 1
        els