Python插入排序算法实现教程 - 详细步骤与代码示例

"""
http://mobi.zfpaper.net 
http://cctv.zfpaper.net 
http://nab.zfpaper.net  
http://cctv6.zfpaper.net    
http://cctv5.zfpaper.net  
"""  

def insertion_sort(arr):
    # 遍历从1到数组长度
    for i in range(1, len(arr)):
        key = arr[i]  # 当前需要插入的元素
        j = i - 1    # 已排序部分的最后一个元素索引
        
        # 将大于key的元素向后移动
        while j >= 0 and key < arr[j]:
            arr[j + 1] = arr[j]
            j -= 1
        
        # 插入key到正确位置
        arr[j + 1] = key

# 测试插入排序
if __name__ == "__main__":
    data = [5, 2, 4, 6, 1, 3]
    print("原始数组:", data)
    insertion_sort(data)
    print("排序后数组:", data)

def binary_insertion_sort(arr):
    for i in range(1, len(arr)):
        key = arr[i]
        # 使用二分查找找到插入位置
        left, right = 0, i - 1
        while left <= right:
            mid = (left + right) // 2
            if key < arr[mid]:
                right = mid - 1
            else:
                left = mid + 1
        # 将元素插入到正确位置
        for j in range(i - 1, left - 1, -1):
            arr[j + 1] = arr[j]
        arr[left] = key