A B—Quick Sorting Algorithm
Zhu Hong · Jisuanji gongcheng · 2002
This paper presents a Bquick sorting algorithm whose speed and stability are better than quick sorting algorithm, —especially for a lot of atoms of a data set. The sorting result of Bquick sorting algorithm is also compared with the theory lowerbound. —