The method is not only obviously quicker than that of quick sort, but also much quicker than the bucket sorting method, even in the case of non-uniformly distributed data.
该排序方法不仅在速度上明显快于快速排序法,而且在非均匀分布数据的情况下也明显快于桶排序法。
2
Instead of parallel bucketsort recommended by some authors, a scheme using parallel regular sampling sort algorithm to construct the finest level data of the distributed tree is presented.