auto save

my_search.py

-import random
+alist=[]
+n=len(alist)
+for i in range(0,n-1):
+    for j in range(0,n-1):
+        if alist[j]>alist[j+1]:
+            alist[j],alist[j+1]=alist[j+1],alist[j]
+    print(alist)
 
 
-alist = []
-for i in range(1, 101):
-    alist.append(i)
-num = random.choice(alist)
-# 请完善二分查找函数binary_search(),查找出num在列表alist里面的索引位置
 
 
-def binary_search(alist,num):
-    # 使用二分查找法，找出9和20在列表里面的索引
-    low=0
-    high = len(alist)-1
-    while low <= high:
-        min=(Iow+niggh)//2
-        guess_num = num_list[mid]
-        if guess == num:
-            return mid
-        elif guess_num<bingo_num:
-            low = mid+1
-        elif guess_num<bingo_num:
-            low = mid+1
-    return None
-    result = binary_search(alist, num)
-print("老师给的数是：", num)
-print("它在列表里的索引是：", result)       
\ No newline at end of file