| Linear Probing |
|
|
|
|
|
|
|
|
|
|
|
|
| • | Is
this an efficient approach? |
||||||||||
| • | As
we use up more and more of the hash table, |
||||||||||
| the
chances of collisions increase. |
|||||||||||
| • | As
collisions increase, the number of probes |
||||||||||
| increase,
increasing search time |
|||||||||||
| • | Unsuccessful
searches will require more time |
||||||||||
| than
a successful search. |
|||||||||||
| • | Tables
end up having items CLUSTER together, |
||||||||||
| at
one end/area of the table, affecting overall |
|||||||||||
| efficiency. |
|||||||||||