Hash table demonstration -
Bitvector
Real numbers between 0 and 1
Strings (example 1)
Strings (example 2)
Objects
Uniform hashing
Random keys
Attack
Universal hashing
Perfect hashing (bad example)
Perfect hashing (n elements in n
2
cells)
Parameters:
Hash function:
function(x) {return x;}
Keys:
-- François Schwarzentruber, francois.schwarzentruber [put AT] ens-rennes.fr