What is the advantage of a hash table as a data structure?
(a) faster access of data
(b) easy to implement
(c) very efficient for less number of entries
(d) exhibit good locality of reference
My enquiry is from Hash Tables topic in chapter Hash Tables of Data Structures & Algorithms I
The question was asked in homework.