auto save

my_search.py

@@ -6,8 +6,12 @@ for i in range(1, 101):
 num = random.choice(alist)
 num = random.choice(alist)
 # 请完善二分查找函数binary_search(),查找出num在列表alist里面的索引位置
 # 请完善二分查找函数binary_search(),查找出num在列表alist里面的索引位置
 list1=[1,3,8,15,11,17,5,20,21,18]
 list1=[1,3,8,15,11,17,5,20,21,18]
-for i in list1:
-    if 
+n=len(list1)
+for i in range(0,n-1):
+    for j in range(0,n-1):
+        if list1[j]>list1[j+1]:
+            list1[j],list1[j+1]=list1[j+1],list1[j]
+print(list1)
 def binary_search(alist,num):
 def binary_search(alist,num):
     low=0
     low=0
     high=len(alist)-1
     high=len(alist)-1
@@ -21,6 +25,6 @@ def binary_search(alist,num):
             high=mid-1
             high=mid-1
     return None
     return None
 
 
-a=binary_search(alist,num)
-print(num)
+a=binary_search(list1,17)
+#print(num)
 print(a)
 print(a)
\ No newline at end of file