Timeline for The fundamentals of Hash tables?
Current License: CC BY-SA 2.5
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 5, 2016 at 2:55 | comment | added | BenKoshy | thanks for your answer - but how is the hashtable different from say, a dictionary? they both have keys/value pairs. so i'm confused about their difference(s). | |
| Nov 12, 2008 at 10:41 | comment | added | S.Lott | NO. A hash table does not ever traverse. It computes a hash of "Chris" and that's the physical slot in the hash table that will have "Chris" as the key. The hash is a computation on the byte values (see MD5 algorithm for details.) | |
| Nov 12, 2008 at 1:47 | comment | added | ashokgelal | @me.yahoo.com: see my comment below for this (couldn't write here because of size limitation) | |
| Nov 12, 2008 at 1:43 | comment | added | Daniel Spiewak | Good question. Will address in a separate answer... If you're impatient, try checking out the Wikipedia article. | |
| Nov 12, 2008 at 1:41 | comment | added | kylex | Okay, but in actual implementation, doesn't the table.get("Chris") still have to traverse the table to find Chris? How does it know Chris is at a "key" value? When it hashes, what is the actually happening to "Chris"? | |
| Nov 12, 2008 at 1:37 | history | edited | Blair Conrad | CC BY-SA 2.5 | provided links |
| Nov 12, 2008 at 1:30 | history | answered | Daniel Spiewak | CC BY-SA 2.5 |