Question: how do you find the smallest value in a hash table (n: #keys, m:#slots)? How much does it cost? A. O(1) B. O(n) C. O(m)
how do you find the smallest value in a hash table (n: #keys, m:#slots)? How much does it cost?
A. O(1)
B. O(n)
C. O(m)
D. O(lgn)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
