When poll is active respond at
Send pds to 22333
In a hash table, using chaining 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?
10
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