auto save

binary_search.py

 # 使用二分查找法，找出9和20在列表里面的索引
+bingo_num=20
 num_list = [1, 3, 5, 8, 11, 15, 17, 18, 20, 21]
+low=0
+hing=len(num_list)-1
+
+
+while low<=high:
+    mid=(low+high)//2
+    guess_num=num_lis[mid]
+    if guess_num==bingo_num:
+        print("找到他了，他在列表里的索引是："，mid)
+        break
+        elif guess_num<bingo_num:
+            low=mid-1
+        elif guess_num<bingo_num:
+            high=mid-1
+
+
+
+
+
+
+import range(1,101):
+alist[]
+for i in range(1,101):
+    alist.append(i)
+num=random.choice(alist)
+
+def binary_search