save project

binary_search.py

 # 使用二分查找法，找出9和20在列表里面的索引
 # 使用二分查找法，找出9和20在列表里面的索引
+mid=8
 num_list = [1, 3, 5, 8, 11, 15, 17, 18, 20, 21]
 num_list = [1, 3, 5, 8, 11, 15, 17, 18, 20, 21]
+low=0
+high=len(num_list)//2
+while low==high:
+    middle=(low+high)//2
+    j=num_list[middle]
+    if guess==mid:
+        print("find it ",middle)
+        break
+    elif guess<mid:
+        low=middle-1
+    else:
+        low=middle+1
\ No newline at end of file