| 排序算法研究 |
| |
| 引用本文： | 李宝艳,马英红. 排序算法研究[J]. 数字社区&智能家居, 2007, 2(8): 424-425 |
| |
| 作者姓名： | 李宝艳 马英红 |
| |
| 作者单位： | 山东师范大学管理与经济学院 山东济南250014 |
| |
| 摘 要： | 排序在数据处理中占有极重要的位置,排序算法的好坏,直接影响到程序实现的复杂度。本文介绍了常用的基于比较的排序算法及非基于比较的线性排序算法,并详细讨论了各种排序法的实现思想和改进,最后对这些排序算法进行了比较。
|
| 关 键 词： | 排序算法 比较 稳定 线性 |
| 文章编号： | 1009-3044(2007)08-20424-02 |
| 修稿时间： | 2007-04-02 |
Sorting Algorithm Research |
| |
| LI Bao-yan,MA Ying-hong. Sorting Algorithm Research[J]. Digital Community & Smart Home, 2007, 2(8): 424-425 |
| |
| Authors: | LI Bao-yan MA Ying-hong |
| |
| Abstract: | Sorting plays important role in the data processing. Sort algorithm quality, affects the realization order of complexity directly. This article introduced commonly used based on the comparison sort algorithm and non- based on the comparison linearity sort algorithm, and discussed each kind of arrangement method realization thought and the improvement in detail, finally has carried on the comparison to these sort algorithms. |
| |
| Keywords: | Sort algorithm comparison Stable linearity |
| 本文献已被 CNKI 等数据库收录！ |
|
