python-16 树

树

vertex 顶点 element 元素 node 节点

二叉树

二叉树性质

插入排序

origin = [1, 9, 8, 5]
nums = [None] + origin
length = len(nums)
count_move = 0 

for i in range(2, length):
    nums[0] = nums[i]  # 每一趟设定哨兵位
    j = i - 1 
    
    if nums[j] > nums[0]: 
        while nums[j] > nums[0]: #右移 1 0 
            nums[j+1] = nums[j]
            j -= 1 # 多减1 
            count_move += 1 
        nums[j+1] = nums[0] # 插入算法
print(nums[1:])

选择排序不稳定，冒泡排序稳定