Re:Why databases use ordered indexes but programming uses ha...
by Franciscouzo on Monday December 09, 2019 @07:31PM
(#21748358)
The general assumption is that the hash function used is a random oracle, if your hash function is H(s) = 0, then you will obviously end up with lots of collisions.
[ Parent
| on HN ]
There are no comments on this comment yet.