python 插入排序实现

基于Python的插入排序实现

def insertionSort(number):
    print("排序前："+str(number))

    for n in range(1, len(number)):
        exchange(number, n, n-1)
        print("==================")

    print("排序后："+str(number))

def exchange(number, sourceIndex, targetIndex):

    if sourceIndex == 0:
        return

    if(number[sourceIndex] >= number[targetIndex]):
        return

    number[sourceIndex] = number[sourceIndex] ^ number[targetIndex]
    number[targetIndex] = number[sourceIndex] ^ number[targetIndex]
    number[sourceIndex] = number[sourceIndex] ^ number[targetIndex]

    print(number)
    exchange(number, targetIndex, targetIndex-1)


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

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

排序前：[4, 2, 7, 5, 0, 8, 6, 1]

排序后：[0, 1, 2, 4, 5, 6, 7, 8]
[Finished in 0.0s]