链式存储结构上直接插入排序算法的研究与实现

Research and realization of straight insertion sort algorithm on link storage structure

线性表上进行的直接插入排序法是一种较简单的内部排序算法,计算机工作者经常研究和讨论顺序表中直接插入排序算法的实现及其改进,很少研究直接插入排序法在链表上的实现。本文讨论了直接插入排序在单链表上和静态链表上的算法及实现过程。最后分析了算法时间复杂度和空间复杂度。

Straight insertion sort which proceed on linear list is a kind of inner sort algorithms.Computer workers always research and discuss the realization as well as improvement on linear list instead of link list.In this article we discuss the algorithm and realization proceeded on single-link list and static-link list.Finally we analyze the complexity of time and space of the two methods.