save project

binary_search.py

 # 使用二分查找法，找出9和20在列表里面的索引
 # 使用二分查找法，找出9和20在列表里面的索引
-bingo_mum = 20
+bingo_mum = 5
 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
-high = len(num_list)-1
-while low <= high:
+def rfcz(alist,num):
+    low = 0
+    high = len(num_list)-1
+    while low <= high:
         mid = (low+high)//2
         mid = (low+high)//2
         guess = num_list[mid]
         guess = num_list[mid]
         if guess == bingo_mum:
         if guess == bingo_mum:
@@ -14,4 +15,6 @@ while low <= high:
             low = mid+1
             low = mid+1
         else:
         else:
             high = mid-1
             high = mid-1
-   
+    return None
\ No newline at end of file
+rusule = rfcz(num_list,5)
+print(rusule)