binary search using recursion

bsearch_recursion.py

# 재귀함수
def binary_search_rec(seq, target, low,high):
    if low > high:
        return None
    mid = (low+high)//2
    if target == seq[mid]:
        return mid
    elif target<seq[mid]:
        return binary_search_rec(seq, target, low,mid-1)
    else:
        return binary_search_rec(seq, target, mid+1,high)