def findSmallest(arr):

     # 假设第一个元素最小

     smallest = arr[0]

     smallest_index = 0

     for i in range(1,len(arr)):

         if arr[i] < smallest:

             smallest = arr[i]

             smallest_index = i

     return smallest_index

 def selectionSort(arr):

     newArr = []

     for i in range(len(arr)):

         smallest = findSmallest(arr)  # 查找新数组中最小的

         newArr.append((arr.pop(smallest)))  # 讲最小的元素取出，放到新数组中

     return newArr

 # 测试一下

 print(selectionSort([5, 3, 6, 2, 10]))  # [2, 3, 5, 6, 10]