摘要： 提出了一种对任意整数都适用的按位链接快速排序算法,其时间复杂性为(),只需附加其中为待排序数组最大数的位On2n+10k(k数个存储空间。)

关键词: 排序, 算法, 位, 链接

Abstract: This paper gives out a quick sorting algorithm for unit and linking, it proves that with the random integer sequence, the new sorting method has a time complexity of O(n), and requires 2n+10k extra space only (here, k is the unit of the biggest original data). ;;;

中图分类号: 

• TP301.6