4 ms·
I think the lookup would involve a string comparison if the hash matches, and that is also O(n). You should be able to construct a pathological example that end
by bonzini 4y ago
I think the lookup would involve a string comparison if the hash matches, and that is also O(n). You should be able to construct a pathological example that ends up quadratic.
- deleted 4y ago[deleted]