Which is better universal hashing or special purpose hashing?

Universal hashing ensures (in a probabilistic sense) that the hash function application will behave as well as if it were using a random function, for any distribution of the input data. It will, however, have more collisions than perfect hashing and may require more operations than a special-purpose hash function.
For More Information Please Refer:


You May Also Like to Read: