Hash table - Wikipedia
11
Public whispers
6
Contributors
2026-07-16 10:10:07
First whispered
Public whispers on this page
Text Highlight2026-08-09 19:35:41
Original Highlight Excerpt
"Hashing is an example of a space–time tradeoff."
Whisper Note
Ha, the infinite time option sounds like my last interview coding challenge.
Text Highlight2026-08-09 19:26:41
Original Highlight Excerpt
"Hashing is an example of a space–time tradeoff."
Whisper Note
But if memory was infinite, why would anyone bother with hashing anyway?
Text Highlight2026-08-09 16:32:41
Original Highlight Excerpt
"In a well-dimensioned hash table, the average time complexity for each lookup is independent of the number of elements stored"
Whisper Note
Average is the key word—worst case is still a nightmare though.
Text Highlight2026-08-09 16:23:41
Original Highlight Excerpt
"In a well-dimensioned hash table, the average time complexity for each lookup is independent of the number of elements stored"
Whisper Note
This is why databases use them under the hood for lookups.
Text Highlight2026-08-09 16:14:41
Original Highlight Excerpt
"In a well-dimensioned hash table, the average time complexity for each lookup is independent of the number of elements stored"
Whisper Note
Depends on the hash function, if it's bad you're back to O(n).
Text Highlight2026-07-16 16:34:07
Original Highlight Excerpt
"The performance of the hash table deteriorates in relation to the load factor"
Whisper Note
Yeah, that's why I always keep my load factor low or the whole thing turns into a linked list.
Text Highlight2026-07-16 13:31:07
Original Highlight Excerpt
"Hashing is an example of a space–time tradeoff"
Whisper Note
So basically hashing is just cheating the speed vs storage balance, right?
Text Highlight2026-07-16 13:22:07
Original Highlight Excerpt
"Hashing is an example of a space–time tradeoff"
Whisper Note
Classic tradeoff — you always end up paying somewhere, either in RAM or in CPU cycles.
Text Highlight2026-07-16 10:28:07
Original Highlight Excerpt
"a hash table is a data structure that implements an associative array"
Whisper Note
Reminds me of that time I built a dictionary in Python—so much easier.
Text Highlight2026-07-16 10:19:07
Original Highlight Excerpt
"a hash table is a data structure that implements an associative array"
Whisper Note
I still don't get why they can't just use an array for everything.
Text Highlight2026-07-16 10:10:07
Original Highlight Excerpt
"a hash table is a data structure that implements an associative array"
Whisper Note
So basically it's just a fancy way to look stuff up fast.
Share this page's whispers
Short link
https://domwhisper.com/s/69cdf2d85abeEmbed snippet
<iframe src="https://domwhisper.com/embed/69cdf2d85abe" width="100%" height="480" style="border:0;border-radius:16px" loading="lazy"></iframe>See what people are discussing on en.wikipedia.org
Install DomWhisper to view live whispers as you browse, and join the discussion.
Get the extension