«

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?

On Sun, 07 Jan 2007 14:06:58 -0500, "zoro"
<> wrote in comp.lang.c++:

> 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 news:comp.programming. 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.

--
Jack Klein
Home: http://JK-Technology.Com
FAQs for
comp.lang.c http://c-faq.com/
comp.lang.c++ http://www.parashift.com/c++-faq-lite/
alt.comp.lang.learn.c-c++
http://www.contrib.andrew.cmu.edu/~a...FAQ-acllc.html