save project

binary_search.py

 # 使用二分查找法，找出9和20在列表里面的索引
-num_list = [1, 3, 5, 8, 11, 15, 17, 18, 20, 21]
-num=20
-low=0
-hidkj=len(num_list)-1
-while low <= hidkj:
+num_list = [1, 3, 5, 8, 11, 15, 17, 18, 20, 21]#列表
+num=3#要找的数字
+low=0#起点索引
+hidkj=len(num_list)-1#终点索引
+while low <= hidkj:#循环直到起点索引小于终点索引
     midl=(low+hidkj)//2
     q=num_list[midl]
     if q<num: