| Hash tables |
|
|
|
|
|
|
|
|
|
|
|
|
| • | So,
using this type of approach...to insert would simply |
||||||||||
| be: |
|||||||||||
| – | Step
1: Tell the "black box" (formally called the |
||||||||||
| hashing
function) the search key of the item to be |
|||||||||||
| inserted |
|||||||||||
| – | Step
2: The "black box" returns to us the location |
||||||||||
| where
we should insert the item (e.g., location i) |
|||||||||||
| – | Step
3: Table[location i] = newitem |
||||||||||