Z
zoro
separate chaining and linear probing are two implementation in hashing that
we use to reduce collisions.
i know that linear probing is the fastest in general than other
implemenataions.
but what i'm confused a bout is when the collisions are frequent,which of
these implementations will allow fastest searches?
we use to reduce collisions.
i know that linear probing is the fastest in general than other
implemenataions.
but what i'm confused a bout is when the collisions are frequent,which of
these implementations will allow fastest searches?