摘要
线性表上进行的冒泡排序法是一种较简单的内部排序算法,计算机工作者经常研究和讨论顺序表中冒泡排序算法的实现及其改进,很少研究冒泡排序法在链表上的实现.本文讨论了冒泡排序在单链表上和静态链表上的算法及实现过程.最后分析了算法时间复杂度和空间复杂度.
Bubble 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.
出处
《甘肃高师学报》
2011年第5期30-31,共2页
Journal of Gansu Normal Colleges
关键词
冒泡排序
存储结构
单链表
静态链表
算法分析
bubble sort
storage structure
single-link list
static-link list
analysis of algorithm
