python 选择排序实现

选择排序分析

基于Python的选择排序实现

def selectionSort(number):

    print("原始数据："+str(number))
    for n in range(0,len(number)-1):
        targetIndex = n

        for m in range(n+1,len(number)):

            print("targetIndex="+str(targetIndex)+"   m="+str(m))

            if number[targetIndex] <= number[m] :
                continue
            else:
                targetIndex = m

            print("m===>  "+str(targetIndex))

        if n != targetIndex:
            number[n] = number[n] ^ number[targetIndex]
            number[targetIndex] = number[n] ^ number[targetIndex]
            number[n] = number[n] ^ number[targetIndex]

        print(number)
        print("======================")

    print("排序后的数据"+str(number))


number = [4,2,7,5,0,8,6,1]

selectionSort(number)

排序结果如下(如需查看排序过程，可运行程序查看输出内容)：

原始数据：[4, 2, 7, 5, 0, 8, 6, 1]

排序后的数据[0, 1, 2, 4, 5, 6, 7, 8]
[Finished in 0.1s]