#selection_sort.py
def findSmallest(arr):
smallest=arr[0]
smallest_index=0for i in range(1,len(arr)):if arr[i]<smallest:
smallest=arr[i]
smallest_index=i
return smallest_index
def selection_sort(arr):
newArr=[]for i in range(len(arr)):
smallest=findSmallest(arr)
newArr.append(arr.pop(smallest))return newArr
##python数据打乱列表的方法
# t = [1,2,3] #shuffle n. 洗牌;拖着脚走;曳步舞 v.随机播放;搅乱;混合# random.shuffle(t)
##生成一组随机数列表
#import random#list=[]#for i in range(10):# list.append(random.randint(1,100))#print(list)
#test.py
from search import *
from selection_sort import *
import random
import time
list=[]for i in range(10):
list.append(random.randint(1,10))print(list)print(selection_sort(list))
def selectionsort(arr):for i in range(len(arr)):
min_index =i
for j in range(i+1,len(arr)):if arr[j]<arr[min_index]:
min_index=j
if i!=min_index:
arr[i],arr[min_index]=arr[min_index],arr[i]return arr
if __name__=="__main__":
import random
s =[]for i in range(10):
s.append(random.randint(0,100))print(s)print(selectionsort(s))
#selection_sort.pydef findSmallest(arr): smallest=arr[0] smallest_index=0 for i in range(1,len(arr)): if arr[i]<smallest: smallest=arr[i] smallest_index...