It Can Happen to You

Re:It Can Happen to You by dorgo on Thursday March 04, 2021 @02:32AM (#26339703)

But, isn't the key length a constant and we are back to O(1)? Ok, in theory you could exhaust all possible keys of a certain length and proceed with longer keys. It would give us what? O(ln(n))?

[ Parent | on HN ]

Re:It Can Happen to You by OskarS on Thursday March 04, 2021 @09:43AM (#26343029)

His point is, if you use Moby Dick as the key, it's going to take longer to hash that than a three letter string. Hashing isn't O(1) if the key has variable size.

[ Parent | on HN ]