递归查找算法与Python程序设计方法
递归查找算法的二分查找递归版本：
def recBinSearch(x, nums, low, high):
if low > high:
return -1
mid = (low + high) // 2
if x == nums[mid]:
return mid
elif x < nums> return recBinSearch(x, nums, low, mid-1)
else:
return recBinSearch(x, nums, mid+1, high)
def search(x, nums):
return recBinSearch(x, nums, 0, len(nums)-1)
*Lu Chaojun, SJTU*
def recBinSearch(x, nums, low, high):
if low > high:
return -1
mid = (low + high) // 2
if x == nums[mid]:
return mid
elif x < nums> return recBinSearch(x, nums, low, mid-1)
else:
return recBinSearch(x, nums, mid+1, high)
def search(x, nums):
return recBinSearch(x, nums, 0, len(nums)-1)
*Lu Chaojun, SJTU*
文件大小：1.74MB
评论区