MIT's Introduction to Algorithms, Lectures 7 and 8: Hashing

You're viewing a comment by Petrea Stefan and its responses.

September 05, 2008, 00:06

Complementary to this lecture a nice exposure of hash tables is also present in "The ANSI C Programming Language" Kernighan & Ritchie 2nd edition page 143 section 6.6
It is a more practical approach but it is effective.
Also an exercice is present.

Note:

In testing a hash table one is interested also
how the hash table behaves if the collisions do occur(altough they are not desirable).
To provoke some "artificial" collisions one can lower the HASHSIZE(the one presented in the book above).

Reply to this comment

Reply To This Comment

(why do I need your e-mail?)

(Your twitter name, if you have one. (I'm @pkrumins, btw.))

Comment Help

Type first 3 letters of your name: (just to make sure you're a human)

Please preview the comment before submitting to make sure it's OK.