save project

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]
\ No newline at end of file
+kla=20
+low=1
+high=len(num_list)-1
+while low<=high:
+    mid=(low+high)//2
+    guess=num_list[mid]
+    if guess==kla:
+        print('找到了')
+        exit()
+    elif guess<kla:
+        low=mid+1
+    elif guess>kla:
+        high=mid-1
+print('没有')
\ No newline at end of file