摘要: 搜索与排序 (一)二分搜素 Binary Search (iterative): def bi_search_iter(alist, item): left, right = 0, len(alist) - 1 while left <= right: mid = (left + right) // 阅读全文
posted @ 2020-06-08 21:49 sowhat1943 阅读(137) 评论(0) 推荐(0) 编辑