| 最佳基数排序 |
| |
| 引用本文： | 陈怀谟,王卡佳.最佳基数排序[J].计算机研究与发展,1993,30(5):45-49. |
| |
| 作者姓名： | 陈怀谟 王卡佳 |
| |
| 作者单位： | 国防科技大学计算机系，国防科技大学计算机系 长沙，410073，长沙，410073 |
| |
| 摘 要： |
|
| 关 键 词： | 基数排序 排序 基数 |
The Best Radix Sorting |
| |
| Chen Huaimo Wang Kajia National University of Defence Technology,Changsha.The Best Radix Sorting[J].Journal of Computer Research and Development,1993,30(5):45-49. |
| |
| Authors: | Chen Huaimo Wang Kajia National University of Defence Technology Changsha |
| |
| Affiliation: | Chen Huaimo Wang Kajia National University of Defence Technology,Changsha,410073 |
| |
| Abstract: | Radix sorting is widely used for its high efficiency.Generally,the radix used for radix
sorting is 10.However,it is very significant to find a radix r_(best) that makes sorting time minimum.In
this paper,we give a method to find r_(best),analyse the complexity of the radix sorting which uses r_(best)
as radix,present a way to improve the efficiency,and compare the speed of the radix sorting which
uses r_(best) as radix with that of the radix sorting which uses 10 as radix. |
| |
| Keywords: | radix sorting sorting radix complexity |
| 本文献已被 CNKI 维普 等数据库收录！ |
|
