save project

bcn n c gc.py

+import random
+alist=[]
+for i in range(1,101):
+    alist.append(i)
+    num=random.choice(alist)
+def binary_search(alist,num):
+    low=0
+    high=len(alist)-1
+    while low<=high:
+        mid=(low+high)//2
+        guess=alist[mid]
+        if guess==num:
+            return mid
\ No newline at end of file

fngfv cxng jgfv.py

+
+num_list=[1,3,5,8,11,15,17,18,20,21]
+bingo_num=20
+low=0
+high=len(num_list)-1
+while low<=high:
+    mid=(low+high)//2
+    guess_num=num_list[mid]
+    if guess_num==bingo_num:
+        print('fvhjhh')
+        break
+    elif guess_num<bingo_num:
+        low=mid+1
+    elif guess_num>bingo_num:
+        high=mid-1
\ No newline at end of file