Hash table - Wikipedia
11
公开标注数
6
参与人数
2026-07-16 10:10:07
首次 Whisper
本页的公开 Whisper
划选高亮2026-08-09 19:35:41
原文高亮摘录
“Hashing is an example of a space–time tradeoff.”
Whisper 随想笔记
Ha, the infinite time option sounds like my last interview coding challenge.
划选高亮2026-08-09 19:26:41
原文高亮摘录
“Hashing is an example of a space–time tradeoff.”
Whisper 随想笔记
But if memory was infinite, why would anyone bother with hashing anyway?
划选高亮2026-08-09 16:32:41
原文高亮摘录
“In a well-dimensioned hash table, the average time complexity for each lookup is independent of the number of elements stored”
Whisper 随想笔记
Average is the key word—worst case is still a nightmare though.
划选高亮2026-08-09 16:23:41
原文高亮摘录
“In a well-dimensioned hash table, the average time complexity for each lookup is independent of the number of elements stored”
Whisper 随想笔记
This is why databases use them under the hood for lookups.
划选高亮2026-08-09 16:14:41
原文高亮摘录
“In a well-dimensioned hash table, the average time complexity for each lookup is independent of the number of elements stored”
Whisper 随想笔记
Depends on the hash function, if it's bad you're back to O(n).
划选高亮2026-07-16 16:34:07
原文高亮摘录
“The performance of the hash table deteriorates in relation to the load factor”
Whisper 随想笔记
Yeah, that's why I always keep my load factor low or the whole thing turns into a linked list.
划选高亮2026-07-16 13:31:07
原文高亮摘录
“Hashing is an example of a space–time tradeoff”
Whisper 随想笔记
So basically hashing is just cheating the speed vs storage balance, right?
划选高亮2026-07-16 13:22:07
原文高亮摘录
“Hashing is an example of a space–time tradeoff”
Whisper 随想笔记
Classic tradeoff — you always end up paying somewhere, either in RAM or in CPU cycles.
划选高亮2026-07-16 10:28:07
原文高亮摘录
“a hash table is a data structure that implements an associative array”
Whisper 随想笔记
Reminds me of that time I built a dictionary in Python—so much easier.
划选高亮2026-07-16 10:19:07
原文高亮摘录
“a hash table is a data structure that implements an associative array”
Whisper 随想笔记
I still don't get why they can't just use an array for everything.
划选高亮2026-07-16 10:10:07
原文高亮摘录
“a hash table is a data structure that implements an associative array”
Whisper 随想笔记
So basically it's just a fancy way to look stuff up fast.
分享本页 Whisper
短链接
https://domwhisper.com/s/69cdf2d85abe嵌入代码
<iframe src="https://domwhisper.com/embed/69cdf2d85abe" width="100%" height="480" style="border:0;border-radius:16px" loading="lazy"></iframe>