选择排序算法

selectsort.py

# 实现一
def selectionSort(arr):
    for i in range(len(arr) - 1):
        tmp = i
        for j in range(i+1, len(arr)):
            if arr[tmp] > arr[j]:
                tmp = j
        if i != tmp:
            arr[i], arr[tmp] = arr[tmp], arr[i]
            
# 实现二
def findSmallest(arr):
    smallest = arr[0]
    index = 0
    for i in range(1, len(arr)):
        if arr[i] < smallest:
            smallest = arr[i]
            index = i
    return index
  
def selectionSort(arr):
    newArr = []
    for i in range(len(arr)):
        smallest = findSmallest(arr)
        newArr.append(arr.pop(smallest))
    return newArr