摘要
提出一种新的2路插入排序算法,给出算法思想及其实现,与传统循环2路插入排序算法相比,该算法在时间复杂度保持不变的情况下,空间复杂度由原来的O(n)降低为O(1)。
Proposes a new 2-way insertion sort algorithm, and introduces its algorithm principle and im- plementation. The space complexity is reduced from O(n) to O(1) under the same time com- plexity, compared to the original circular 2-way insertion sort algorithm.
基金
甘肃省教育厅科研项目(No.1108B-01)
关键词
数据结构
2路插入排序
算法
Data Structure
2-Way Insertion Sort
Algorithm