What is the worst-case time for putting n entries in an initially empty hash table, with collisions resolved by chaining? What is the best case?
Sorry the answer is not available at the moment…
If you are able to find the answer, please make sure to post it here. So that your Juniors have smile on their lips and feel happy.
Spread the 'tradition of sharing'.