Searching for an element in the hash table requires O(1) time for the ............... time, whereas for direct addressing it holds for the ............. time.
A. worst-case, average
B. worst-case, worst-case
C. average, worst-case
D. best, average
Answer:C
Searching for an element in the hash table requires O(1) time for the ............... time, whereas for direct addressing it holds for the ............. time.
A. worst-case, average B. worst-case, worst-case C. average, worst-case D. best, average