Imagine that instead of searching though a tree of values there existed
a function h(key) which when executed returned the location of the
Location = h(key)
Let the locations of values be positions in an array or vector. Then
we have int location = h(key).
(1,2,3,4,5,6,7) = h(key)
Back to first slide
View graphic version