1 def findSmallest(arr):
2 smallest = arr[0] #存储最小到值
3 smallest_index = 0 #存储最小元素索引
4 for i in range(1,len(arr)):
5 if arr[i] < smallest:
6 smallest = arr[i]
7 smallest_index = i
8 return smallest_index
9 def selectionSort(arr): #对数组进行排序
10 newArr = []
11 for i in range(len(arr)):
12 smallest = findSmallest(arr) #找出数组中最小的元素,并加到末尾
13 newArr.append(arr.pop(smallest))
14 return newArr
15 if __name__=='__main__':
16 print(selectionSort([5,3,6,2,10]))
算法图解-选择排序
最新推荐文章于 2022-11-01 08:33:28 发布