What is Simple Uniform Hashing, and why searching a hashtable has complexity Θ(n) in the worst case


Can anyone explain nicely what Simple Uniform Hashing is, and why searching a hashtable has complexity Θ(n) in the worst case if we don’t have uniform hashing (where n is the number of elements in the hashtable)