Bucket sort

• For each item, the value range is limited, and is integer. For example, sort all students score. (0<=score<=100).
• Basic step: Here, Link list is best option to implement a bucket. Because Nobody will now how many elements will be put into the each bucket.
  1. Set up an array of initially empty "buckets".
  2. Scatter: Go over the original array, putting each object in its bucket.
  3. Sort each non-empty bucket.(Optional )
  4. Gather: Visit the buckets in order and put all elements back into the original array.