save project

binary_search.py

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