A New Efficient Base Sorting Algorithm

Sorting is a kind of importantion operation in data processing and it is convenient in data searching.Commonly used inside sorting algorithms' time complex is O(n2)and O(nlog2n)in optimization.Based on study of base sorting,a new base sorting algorithm is proposed.By making two times of base sorting to the low half and the high half of the keys,the sorting function is fast realized.At last,a comparison of numerical experiments for new algorithm and other sorting algorithms is given,which shows that the new algorithm has higher efficiency and achieves O(nlog2n)time complex.