A Byte-Guick Sorting Algorithm

Zhu Hong · Jisuanji gongcheng · 2002

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.

Read the paper · More papers on PaperTik