| 转移排序算法 |
| |
| 引用本文： | 刘强,从弟胜.转移排序算法[J].淮南职业技术学院学报,2005,5(1):81-83. |
| |
| 作者姓名： | 刘强 从弟胜 |
| |
| 作者单位： | 淮南职业技术学院,安徽,淮南,232035 |
| |
| 摘 要： | 主要是对传统排序算法进行改进的“转移”排序算法的基本原理进行了分析，对其程序流程进行了讨论，对转移排序算法的时间复杂度进行了测算；从而得到了其排序时间性能为O(n)，比传统算法在时间性能上有所提高。
|
| 关 键 词： | 转移算法 算法性能 算法的讨论 |
| 文章编号： | 1671-4733(2005)01-0081-03 |
| 修稿时间： | 2005年1月2日 |
Transferred Taxis Arithmetic |
| |
| LIU Qiang,CONG Di-sheng.Transferred Taxis Arithmetic[J].Journal of Huainan Vocational & Technical College,2005,5(1):81-83. |
| |
| Authors: | LIU Qiang CONG Di-sheng |
| |
| Abstract: | This paper mainly analyzes the basic principles of transferred taxis arithmetic, which has improved the traditional taxis arithmetic, then discusses its sort program, measures the complexity of the time about the transferred taxis arithmetic. Therefore, it proved that its timeliness of taxis is O (n), has been improved a lot, compared with the traditional one. |
| |
| Keywords: | transferred taxis arithmetic property of arithmetic discusion of arithmetic |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
