摘要
提出一种新的Byte－快速排序算法,其排序的速度比B－快速排序算法及快速排序算法要快，且稳定性好。并对其结果排序的速度与B－快速排序算法[3]及理论下界作了比较。
This paper presents a Byte－quick sorting algorithm.The speed, and the stability of Byte--quick sorting algorithm are more better than B－quick sorting algorithm and quick sorting algorithm. The sorting running results of Byte--quick sorting algorithm have been compared with B－quick sorting algorithm and the theory lowerbound.
出处
《计算机工程》
CAS
CSCD
北大核心
2002年第12期39-40,57,共3页
Computer Engineering
