Which of the following trait of a hash function is most desirable?
(a) it should cause less collisions
(b) it should cause more collisions
(c) it should occupy less space
(d) it should be easy to implement
Query is from Hash Tables topic in portion Hash Tables of Data Structures & Algorithms I
I got this question in an internship interview.