save project

my_search.py

 import random
 import random
-
 alist = []
 alist = []
 for i in range(1, 101):
 for i in range(1, 101):
     alist.append(i)
     alist.append(i)
 num = random.choice(alist)
 num = random.choice(alist)
+for i in range(0,len(alist)-1):
+    for j in range(0,len(alist)-1):
+        if alist[j]>alist[j+1]:
+            alist[j],alist[j+1] = alist[j+1],alist[j]
 # 请完善二分查找函数binary_search(),查找出num在列表alist里面的索引位置 
 # 请完善二分查找函数binary_search(),查找出num在列表alist里面的索引位置 
-for i in range(len(alist)-1):
-    if i 
 def binary_search(alist,num):
 def binary_search(alist,num):
     low = 0
     low = 0
     high = len(alist) - 1
     high = len(alist) - 1