auto save

binary_search.py

 # 使用二分查找法，找出9和20在列表里面的索引
 # 使用二分查找法，找出9和20在列表里面的索引
 num_list = [1, 3, 5, 8, 11, 15, 17, 18, 20, 21]
 num_list = [1, 3, 5, 8, 11, 15, 17, 18, 20, 21]
 
 
+def bite(alist, num):
+    a = 0
+    h = len(alist)-1
+    while a >= h:
+
+
+
+re = bite(num_list, 11)
\ No newline at end of file