save project

binary_search.py

 # 使用二分查找法，找出9和20在列表里面的索引
 # 使用二分查找法，找出9和20在列表里面的索引
+num_k=1
 num_list = [1, 3, 5, 8, 11, 15, 17, 18, 20, 21]
 num_list = [1, 3, 5, 8, 11, 15, 17, 18, 20, 21]
-num=20
-low=0
-high=9
-mid=(low+high)//2
-guess=num_list[mid]
-while guess != num:
-    mid=(low+high)//2
-    guess=num_list[mid]
-    if guess==num:
-        print("yes")
-        print(mid)
-    elif guess<num:
-        low=mid+1
-    else:
-        high=mid-1
+def qq(k,num):
+ low=0
+ high=len(k)-1
+ mid=(low+high)//2
+ guess=num_list[mid]
+ while guess != num:
+     mid=(low+high)//2
+     guess=num_list[mid]
+     if guess==num:      
+         print(mid)
+         break
+     elif guess<num:
+         low=mid+1
+     else:
+         high=mid-1
+a=qq(num_k,1)
+print(a)
+
     
     
+ 
+
 
 
     
     
  
  
+
+