Hash Functions: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
|||
| Line 5: | Line 5: | ||
* [[Hash_Table#Hash_Functions|Hash Tables]] | * [[Hash_Table#Hash_Functions|Hash Tables]] | ||
=Overview= | =Overview= | ||
The hash function should be easy to compute, in constant time. It should "spread out" most of the data set (the non-pathological data sets). The has function should be easy to store. | |||
Revision as of 00:28, 17 October 2021
External
- https://www.coursera.org/learn/algorithms-graphs-data-structures/lecture/Ob0K7/hash-tables-implementation-details-part-i
- https://www.coursera.org/learn/algorithms-graphs-data-structures/lecture/1Y8t1/hash-tables-implementation-details-part-ii
Internal
Overview
The hash function should be easy to compute, in constant time. It should "spread out" most of the data set (the non-pathological data sets). The has function should be easy to store.