摘要
本文给出一种快速排序方法——数字排序法。当记录的关键字是整数时 ,按记录关键字的各位数字对记录排序。算法的时间复杂度为 O( kn) ,空间复杂度为 O( c)。 k和 c是与关键字位数有关的两个常数。
The paper deals with a digit sorting method that is a quick sorting method. When the key of record is an integer, records are sorted on every digit of the key of record. The time complexity of the algorithm is O(kn),and the space complexity is O(c),where k and c are two constants associated with the digit of the key.
出处
《宿州学院学报》
2004年第5期76-76,100,共2页
Journal of Suzhou University
