Question objective

Hashing involves finding a function f(k) which converts the key (k) into a numeric value which can be used as an index into an array. Which of the following is the main problem faced when using this technique?
(a) Searching is slow due to the function used to generate key
(b) Collisions may happen when key is inserted into a location in the array
(c) Difficult to detect the location of a key that has been stored
(d) Storage needed for this technique is too big
(e) None of the above

what's the answer? for me quite blur
i will said that answer should be b.
Why do you think it is b?
because all array is like reference & . so i think that array is already a primary key .
Topic archived. No new replies allowed.