 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
| • |
To
retrieve, our algorithm would be:
|
|
|
|
– |
Use
the hash function to find the hash index
|
|
|
|
– |
Begin
traversing down the linked list searching for a
|
|
|
match
|
|
|
|
– |
Terminate
the search when either a match is
|
|
|
encountered
or the end of the linked list is reached.
|
|
|
|
– |
If a
match is made...return the item & a flag of
|
|
|
SUCCESS!
|
|
|
|
– |
If
the end of the list is reached and no match is found,
|
|
UNSUCCESS
|
|