梦乡尘子

摘要： ```python ''' 这是一个二分查找的算法''' ls1 = [85, 97, 102, 208, 209, 260, 497, 769, 791, 975] def binary_select(alist, v): n = len(alist) start = 0 end = n - 1 while start v: end = mid - 1 else: start = mid + 1 阅读全文

摘要： ```python '''这是一个顺序查找的算法题''' ls1 = [165, 92, 283, 272, 38, 87, 520, 242, 549, 844] def sx_find(ls, v): n = len(ls) for i in range(n): if ls[i] == v: return i return -1 print(sx_find(ls1, 594)) print(s 阅读全文