递归查找算法 ·两分查找的递归版本： def recBinsearch(x,nums,low,high): if low high: return -1 mid (low high)/2 if x =nums [mid] return mid elif x nums [mid]: 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 10递归查找算法 • 两分查找的递归版本: def recBinSearch(x, nums, low, high): if low > high: return -1 mid = (low + high) / 2 if x == nums[mid] return mid elif x < nums[mid]: 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 10