Join GitHub today
GitHub is home to over 31 million developers working together to host and review code, manage projects, and build software together.Sign up
complexity for searching #4
The Readme suggests that this algorithm has a O(1) time complexity for searching.
Surely you are not wrong. The intention of O(1) statement is to claim that it's not dependent on the database size, just like how hash table does similarly on non-colliding cases, despite the fact that it still takes O(m) on hash function evaluation.
Anyway, I agree to add some more precision to the description. Let me revise it like this: