auto save

binary_search.py

 # 使用二分查找法，找出9和20在列表里面的索引
 num_list = [1, 3, 5, 8, 11, 15, 17, 18, 20, 21]
-ww1=0
-ww2=9
-num=15
-wwe=(ww2+ww1)//2
-ww3=num_list[wwe]
-if wwe==num:
+def ddd(num):
+    ww2=0
+    ww1=len(num_list)-1
+    while True:
+        wwe=(ww2+ww1)//2
+        ww3=num_list[wwe]
+        if ww3==num:
             print("sb")
-elif wwe<num:
-    ww3=wwe+1
-else:
-    ww2=wwe -1
\ No newline at end of file
+            print(wwe)
+            break
+        elif ww3<num:
+            ww2=wwe+1
+        else:
+            ww1=wwe -1
+        if ww2>ww1:
+            print(www)
+            break
+ddd(3)
\ No newline at end of file