Timeline for Advantages of using an array over a hash table?
Current License: CC BY-SA 4.0
2 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 30, 2018 at 0:42 | comment | added | Tony | "If there were no collisions, and we ignore the CPU cost of hashing the key, and we don't store any of the hash codes, the hashtable would consume the same amount of space." - you'd also need to avoid empty buckets (i.e. the stored values have to be contiguously packed into the buckets), and hash tables usually store the key (for this scenario, the "logical" array index) which an array doesn't have to do - that would have to be avoided to keep memory consumption the same: i.e. the implementation would need to rely on having no collisions. | |
| May 10, 2018 at 18:02 | history | answered | Frank Hileman | CC BY-SA 4.0 |