In this paper, the bucket sorting method in [1] is studied further, and ahighly-efficient bucket sorting method-twice bucket sorting method by linking,which is suitable to non-uniformly distributed data,is presented.

Classical bucket sort algorithm implements buckets as dynamic lists.

Based on statistical theory, this paper presents a sample-seperators scheme to broaden the ussage of bucket sort algorithm.

A new algorithm called second solid heap sort is proposed based solid heap sort analysis with subsection optimum data processing method,the algorithm ideas,algorithm description and analysis is given,efficiency of the new algorithm is increasing better than solid heap sort algorithm along with more and more data sorted.

The optimization means based on the classical Dijkstra’s algorithm is analyzed,and then the improvement of algorithm is presented from two aspects:bucket-sort structure and beeline optimizing A* algorithm with heuristic gene.

Instead of parallel bucket sort recommended by some authors,a scheme using parallel regular sampling sort algorithm to construct the finest level data of the distributed tree is presented.