4 ms·
(I'm the author of the post) You're right in terms of big-O it's O(1), that is O(k) and O(1) mean the same thing. I said O(k) because BFs normally require mult
by nitayj 12y ago
(I'm the author of the post)
You're right in terms of big-O it's O(1), that is O(k) and O(1) mean the same thing. I said O(k) because BFs normally require multiple, but constant amount, of operations (hashes).