save project

binary_search.py

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