Algorithms: Test Series(Hashing)

Question

Consider an initially empty symbol table implemented using a hash table of size ‘B’ with hash function h(C) = C mod B. In worst case for any possible sequence of inputs where N > B, what is the order of growth of inserting N (key, value) pairs with distinct key into table, if separate chaining is used to resolve collisions?

A Ο(N)

B Ο (N log N)

C Ο(N³)

D Ο(N²)

Comments

If i get you correct ,you rea saying that  input is distinct itself as given in question. So answer will be O(N) ,right?

---

yes..

---

ok thanks. In the given answer they have included searching time.So my mind started to include that also:p