Time Complexity Hashing

Asked Nov 24 '14 at 08:38

Active Feb 07 '15 at 06:49

Viewed 43 times

I'm working on an assignment for creating a hash table and one of the questions asks

If we have M documents, and document D_i consists of N_i words, then how long does this simple solution take to search for a query consisting of K words. Give your answer in big O notation.

I assumed that the answer would be big O(M⋅N).

Also, the second part asks if we use the hash function to be more efficient and all words map evenly across all buckets, what would the big O notation be?

I assumed this answer to be big O(B/N) where B is the number of buckets.

Are these correct?

edited Feb 07 '15 at 06:49

AbcAeffchen

14,400
15
47
66

asked Nov 24 '14 at 08:38

LeslieKnowsBest

It is not clear what "this simple solution" is. Could you provide an example and make your question more clear please? – AbcAeffchen Feb 07 '15 at 06:48
By a simple solution, they are referring to using the easier way of iterating through every single document. – LeslieKnowsBest Feb 09 '15 at 00:45

Time Complexity Hashing

0 Answers0