摘要: def binary_search(List, item): # 设置头指针和尾指针 low = 0 height = len(List) - 1 # 当头指针大于尾指针时,查找结束 while low <= height: mid = (low + height) // 2 guess = List[mid] # 猜测的数 if guess == item: return mid # 返回查找的 阅读全文
posted @ 2019-10-17 09:18 我叫郑小白 阅读(154) 评论(0) 推荐(0) 编辑