For Large Dictionaries Could One Use Separate Dictionaries Where Each Dictionary Covers an Interval of the Input Range?

bob_jenkins at bob_jenkins at
Wed May 17 00:28:43 CEST 2006

If you have the same number of entries as buckets, and you have a good
hash function, then if you have n buckets your longest chain should
have length around ln(n).  The average length of a nonempty bucket
would be somewhere around 1 1/2.

More information about the Python-list mailing list