选择排序
原理: 每次选择最小的元素然后添加到新的数组中,再从剩下的数组中继续挑选
代码实现:
def findSmallItem(arr):
small_index = 0
small = arr[0]
for i in range(1,len(arr)):
if arr[i] < small:
small = arr[i]
small_index = i
return small_index
def selectSort(arr):
sort_list = []
while arr:
index = findSmallItem(arr)
sort_list.append(arr.pop(index))
return sort_list
代码验证:
list_test = [3,5,10,2,1,7,6,8]
print(selectSort(list_test))
list_test = [3,0,10,-1,1,7,6,100]
print(selectSort(list_test))