首页 > 代码库 > Bucket Sort
Bucket Sort
1. Setup an array of initially empty "buckets".
2. Scatter: Traverse the original array and extract each element into its bucket.
3. Sort each non-empty buckets (With each bucket Heapified).
4. Visit the buckets and put them back in order.
https://www.youtube.com/watch?v=aaKNtxHgaq4
Bucket Sort
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。