Activity is now locked.
Responses are not accepted at this time.
In a hash table, using linear probing for collisions, with N array slots and load "lambda" of .5, which of the following gives the best description of the worst case time complexity for the add operation?
0
O(1)
O(log N)
O(log N) / lambda
lambda * O(log N)
O(N)
lambda * O(N)
O(N) / lambda
O(2^N)
Powered by