need help in hashing

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?
 
J

Jack Klein

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?

Ask in Your question has nothing to do with
the C++ language itself, but about algorithms.

Once you have selected an algorithm, if you have problems coding it
correctly in standard C++, post your problem code here and ask for
help.
 

Ask a Question

Want to reply to this thread or ask your own question?

You'll need to choose a username for the site, which only take a couple of moments. After that, you can post your question and our members will help you out.

Ask a Question

Members online

Forum statistics

Threads
473,744
Messages
2,569,482
Members
44,900
Latest member
Nell636132

Latest Threads

Top