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.
该排序方法不仅在速度上明显快于快速排序法，而且在非均匀分布数据的情况下也明显快于桶排序法。
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.
研究了最细层数据的建立方法，提出采用并行正则采样排序算法来代替众多文献所推荐的并行桶排序算法，以此来建立分布树的最细层数据。
The database server does not sort keys in a particular hash bucket.
数据库服务器不会在特定的哈希bucket中对键进行分类。
The database server does not sort keys in a particular hash bucket.
数据库服务器不会在特定的哈希bucket中对键进行分类。
应用推荐