(Choose 1 answer)
Specify the correct statement about hashing algorithm (Select the best answer).
A. No matter how many data items there are, insertion and searching (and sometimes deletion) always take constant time: 0(1).
B. If the chaining method is used for collision resolution, insertion and searching (and sometimes deletion)can take constant time: O(1).
C. The expected complexity of hashing algorithm is O(1). However by the collision resolution, sometimes it may take O(n).
D. If the coalesced method is used for collision resolution, insertion and searching (and sometimes deletion)always take constant time: 0(1).
Q: 12
