蛮力法之直接插入排序

---

直接插入排序

---

一、代码实现

# -*- coding: utf-8 -*-
"""
Created on Wed Nov 10 10:03:36 2021

@author: lenovo
直接插入排序
"""

def insert_sort(array):
    
    if len(array) == 0 or len(array) == 1:
        return -1
    
    for i in range(len(array)-1):
        
        t = array[i+1]
        
        j = i
        while t < array[j] and j >= 0:
            
            array[j+1] = array[j]
            j-=1
        
        array[j+1] = t


select_list = [1, 23, 45, 8, 75, 6, 2, 31, 4, 5]
                    
print(select_list)

insert_sort(select_list)

print(select_list)

二、打印结果

---

下一篇

蛮力法之解数字谜