next up previous
Next: Better Solution Up: l5 Previous: l5

Hash Tables



Problem: Storing a large number of elements (e.g. dictionary, symbol table)



Operations: Insert, Search, [Delete]



Solution: Use a linked list
Insert = $\Theta(1)$
Search = $\Theta(n)$
Delete = $\Theta(n)$


next up previous
Next: Better Solution Up: l5 Previous: l5