auto save

binary_search.py

@@ -3,13 +3,13 @@ num_list = [1, 3, 5, 8, 11, 15, 17, 18, 20, 21]
 high=len(num_list)-1
 high=len(num_list)-1
 low=0
 low=0
 num=20
 num=20
-while high<=low:
+while high>=low:
     mid=(low+high)//2
     mid=(low+high)//2
-    guess=num_list[list]
+    guess=num_list[mid]
     if guess ==num:
     if guess ==num:
         print(mid)
         print(mid)
         break
         break
     elif guess<num:
     elif guess<num:
-        high=mid-1
-    else:
         low=mid+1
         low=mid+1
+    else:
+        high=mid-1