一种B-快速排序算法

A B—Quick Sorting Algorithm

提出一种新的-快速排序算法当数集较大时其排序的速度比快速排序算法快且稳定性好。并对其排序结果与理论下界作了比较。B,

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. —