| 一种新的高效基数排序算法 |
| |
| 引用本文： | 徐寿芳. 一种新的高效基数排序算法[J]. 湖州职业技术学院学报, 2008, 6(1): 17-19 |
| |
| 作者姓名： | 徐寿芳 |
| |
| 作者单位： | 湖州职业技术学院,工商管理分院,浙江,湖州,313000 |
| |
| 摘 要： | 排序是数据处理中一种很重要拘运算，能够方便数据的查找。常用内排序算法时间复杂度接近O（n^2），优化的排序算法接近O（nlog2n）。基于基数排序的新排序方法，通过对关键字的低半部和高半部做两次基数排序，快速实现排序功能。最后给出了新排序算法和常用排序算法的数据排序效率比较，实验证明，它可以使算法的时间复杂度达到O（N），算法的效率远远高于常规的排序算法。
|
| 关 键 词： | 基数排序 时间复杂度 桶 |
| 文章编号： | 1672-2388(2008)01-0017-03 |
| 修稿时间： | 2007-04-12 |
A New Efficient Base Sorting Algorithm |
| |
| XU Shou-fang. A New Efficient Base Sorting Algorithm[J]. Journal of Huzhou Vocational and Technological College, 2008, 6(1): 17-19 |
| |
| Authors: | XU Shou-fang |
| |
| Affiliation: | XU Shou - fang (Faculty of Business, Huzhou Vocational and Technological College, Huzhou 313000, China) |
| |
| Abstract: | Sorting is a kind of importantion operation in data processing and it is convenient in data searching. Commonly used inside sorting algorithms＇ time complex is O（n2）and O（nlog2n）in optimization. Based on study of base sorting, a new base sorting algorithm is proposed. By making two times of base sorting to the low half and the high half of the keys, the sorting function is fast realized. At last, a comparison of numerical experiments for new algorithm and other sorting algorithms is given, whieh shows that the new algorithm has higher effieieney and aehieves O （nlog2 n）time eomplex. |
| |
| Keywords: | base sorting time complex barrel |
| 本文献已被 维普 万方数据 等数据库收录！ |
