2020年10月3日
python3 二分查找法实现
摘要： code def binarySearch(alist, item): first = 0 last = len(alist) - 1 while first <= last: mid = (first + last)//2 if alist[mid] > item: last = mid - 1 阅读全文
posted @ 2020-10-03 22:28 anobscureretreat 阅读(280) 评论(0) 推荐(0)