【Python】插入排序算法，摸鱼失败的第六天

其实这些排序基本是一样的

                                                                                                                         

插入排序=快速排序/2

        快速是取两边同时开始

        插入是取一边开始

                                                                                                                                

 代码可以说明一切

  

def insert_sort(array):
    n = len(array)
    # 列表的长度
    for j in range(1, n):
        key = array[j]
        # 比较的值

        i = j - 1
        while i >= 0 and array[i] > key:# 大于就换位直到小于

            array[i + 1] = array[i]
            # 大于就换位
            i -= 1
        array[i + 1] = key# 换回



array = [5, 4, 2, 6, 1, 3]
insert_sort(array)
print(array)

代码说的十分明确不会？http://www.baidu.com 

 

 

 

             ​​​​​​​        ​​​​​​​        ​​​​​​​        ​​​​​​​        ​​​​​​​        ​​​​​​​        ​​​​​​​                ​​​​​​​        ​​​​​​​        ​​​​​​​        ​​​​​​​        ​​​​​​​