标签：
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
标签：
原文地址：http://www.cnblogs.com/winscoder/p/4269061.html
