Q38,Paper2,j14. 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.
No comments:
Post a Comment
Note: only a member of this blog may post a comment.
No comments:
Post a Comment
Note: only a member of this blog may post a comment.