auto save

binary_search.py

+bingo_num = 20
 # 使用二分查找法，找出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]
 low = 0
 low = 0
 hight = len(num_list)-1
 hight = len(num_list)-1
 while low <= hight: 
 while low <= hight: 
-
     mid = (low+hight) // 2
     mid = (low+hight) // 2
     guess_num = num_list[mid]
     guess_num = num_list[mid]
     if guess_num == bingo_num:
     if guess_num == bingo_num:
@@ -12,4 +12,5 @@ while low <= hight:
     elif guess_num < bingo_num:
     elif guess_num < bingo_num:
         low = mid+1
         low = mid+1
     elif guess_num > bingo_num:
     elif guess_num > bingo_num:
-        hight = mid    
+        hight = mid 
\ No newline at end of file
+def c   
\ No newline at end of file