Bin Sort (a.k.a. Bucket Sort)

• Assumption: The range of possible key values is {0, ..., N-1}, where N is not too much bigger than the number of data elements, n. (It could be smaller.)

• Example: Sorting a collection of 67 two-digit numbers.
  • N = 100
  • n = 67

Previous slide

Next slide

Back to first slide

View graphic version