| 冒泡排序算法在静态链表上的实现 |
| |
| 引用本文： | 吴超云,郝庆一.冒泡排序算法在静态链表上的实现[J].阜阳师范学院学报(自然科学版),2013(4):76-79. |
| |
| 作者姓名： | 吴超云 郝庆一 |
| |
| 作者单位： | 安庆师范学院数学与计算科学学院 |
| |
| 基金项目： | 安徽省教育厅自然科学研究项目(KJ2011B084)资助 |
| |
| 摘 要： | 利用静态链表的原理,冒泡排序算法在静态链表上实现时只改变结点的游标,排好序后再利用order优先搜索算法将每个记录移动到相应位置.实验及分析结果表明,记录移动的时间复杂度由O（n2）下降到O（n）,当单个记录需要较大的存储空间时,效率较高.
|
| 关 键 词： | 冒泡排序 静态链表 状态迁移 order优先搜索 |
Realization of bubble sort algorithm on static linked list |
| |
| WU Chao-yun;HAO Qing-yi.Realization of bubble sort algorithm on static linked list[J].Journal of Fuyang Teachers College:Natural Science,2013(4):76-79. |
| |
| Authors: | WU Chao-yun;HAO Qing-yi |
| |
| Institution: | WU Chao-yun;HAO Qing-yi;School of Mathematics and Computational Science,Anqing Teachers College; |
| |
| Abstract: | Making use of the principle of static linked list, the realization of bubble sort algorithm on static linked list only changes the cursor of nodes. After sorting, order first search is used to move every record to the corresponding position. Experimen- tal results showed that the time complexity of record moving descends from O （ n2 ） toO（ n） and it has higher efficiency when a single record need larger storage space. |
| |
| Keywords: | bubble sort algorithm static linked list state transition order first search |
| 本文献已被 CNKI 维普 等数据库收录！ |
