PPT Slide
Key 1
Value 1
Key 1
Key 1
Key 1
Key 1
Key 1
Value 1
Value 1
Value 1
Value 1
Value 1
h(Smith)
h(Hayden)
h(Sanders)
h(Chooi)
Performance of hash table methods
best average worst
O(1) O(1) O(1)
What are we giving up to get
this performance - Ordered
storage - the ability to traverse
in a meaning order and write
reports.
But there are methods which produce ordered
storage in particular cases.
Previous slide
Next slide
Back to first slide
View graphic version