python实现选择排序算法

版权声明:本文为博主原创文章,转载请注明出处! https://blog.csdn.net/PoGeN1/article/details/85274878
什么是选择排序请看:排序算法:冒泡排序和选择排序的内容,区别与优缺点。
__author__ = "PoHu"
__copyright__ = "PoHu 2018"
__version__ = "1.0.0"
__license__ = "Henu"


def findSmallest(arr):
    smallest_index = 0
    smallest = arr[0]
    for i in range(1,len(arr)):
        if arr[i] < smallest:
            smallest = arr[i]
            smallest_index = i
    return smallest_index

def selectionSort(arr):
    newArray=[]
    for i in range(len(arr)):
        smallest=findSmallest(arr)
        newArray.append(arr.pop(smallest))
    return newArray
print(selectionSort([15,23,6,9,0,4,3,8,12]))

猜你喜欢

转载自blog.csdn.net/PoGeN1/article/details/85274878
今日推荐