1) bucket sort
桶排序
1.
Classical bucket sort algorithm implements buckets as dynamic lists.
经典桶排序算法以链表形式实现“桶”,处理均匀数据效率很高,是O(N)算法。
2.
Based on statistical theory, this paper presents a sample-seperators scheme to broaden the ussage of bucket sort algorithm.
基于统计学理论,提出抽样分点分发策略克服以上问题,扩展桶排序的应用范围。
2) bucket-sort
存储桶排序
1.
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.
在深入分析经典Dijkstra最短路径算法的基础上,从数据结构和搜索策略两方面对算法进行了改进,采用存储桶排序方式,提出了带启发因子的直线优化A*算法。
3) parallel bucket sort
并行桶排序
1.
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.
研究了最细层数据的建立方法,提出采用并行正则采样排序算法来代替众多文献所推荐的并行桶排序算法,以此来建立分布树的最细层数据。
4) twice bucket sorting method by linking
二次链接桶排序
1.
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.
本文进一步研究了桶排序法［１］，提出了适用于非均匀分布数据的高效率的二次链接桶排序法。
5) water bucket
排水吊桶
6) closet horn
便桶排出口
补充资料：直桶桶
1.直而中空。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条