本例实现桶排序，这是算法分析中一个经典的以空间换时间的案例。
Binsort is a classical implementation of the idea that sacrificing space to improve efficiency.
该排序方法不仅在速度上明显快于快速排序法，而且在非均匀分布数据的情况下也明显快于桶排序法。
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 priority is an integer value used to group filters into priority buckets and order their processing.
筛选器的优先级是一个用于将筛选器分组到存储桶的整数值，这些存储桶用于对筛选器的处理进行排序。
The priority of a filter is an integer value used to group filters into buckets that are used to order their processing.
筛选器的优先级是一个用于将筛选器分组到存储桶的整数值，这些存储桶用于对筛选器的处理进行排序。
The priority of a filter is an integer value used to group filters into buckets that are used to order their processing.
应用推荐