Computation Cost

• Bucket positions precomputed

• To hash item

  • compute H
  • find nearest bucket point

• O(log n) time using binary search

• Constant time with auxiliary hash table

Previous slide

Next slide

Back to first slide

View graphic version