静态链式二路插入排序算法的研究

Research of Binary Path Insertion Sort Algorithm on Static Link Storage Structure

排序是计算机操作中的一种常用技术,排序算法在顺序表上有很多实现技术,但在链表上的研究却很少见。本文讨论了在静态链表上的二路插入排序算法的实现思想,并实现了该算法,最后分析了该算法的时间复杂度和空间复杂度。

Sorting is an important operating in computer science. There are many realizations on linear list, but fewer on stat- ic link list. In this article we discuss the Binary Path Insertion Sort Algorithm and realization on static link list. Finally we ana- lyze the complexity of time and space of the two methods.