算法_插值查找_python

#插值查找
def binary_search(lis, key):
  low = 0
  high = len(lis) - 1
  time = 0
  while low <= high:
    time += 1
    # 计算mid值是插值算法的核心代码
    mid = low + int((high - low) * (key - lis[low])/(lis[high] - lis[low]))  

    print("mid=%s, low=%s, high=%s" % (mid, low, high))
    if key < lis[mid]:
      high = mid - 1
    elif key > lis[mid]:
      low = mid + 1
    else:
      # 打印查找的次数
      print("times: %s" % time)
      return mid
  print("times: %s" % time)
  return None

if __name__ == "__main__":
    ll = [2,3,5,6,7,99,555]
    print(orderby(ll,555) )