From 87c4b94797b2c6b5e351ca04b6035ff708ed4983 Mon Sep 17 00:00:00 2001 From: adamdonahue Date: Sat, 29 Dec 2018 10:57:50 -0800 Subject: [PATCH] Fix performance of bloom filter operations. Performance of a bloom filter is on the order of the number of independent hash functions, k, not constant time. --- src/data-structures/bloom-filter/README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/src/data-structures/bloom-filter/README.md b/src/data-structures/bloom-filter/README.md index 4e852dd8..e9833aac 100644 --- a/src/data-structures/bloom-filter/README.md +++ b/src/data-structures/bloom-filter/README.md @@ -44,7 +44,7 @@ In other words, the filter can take in items. When we go to check if an item has previously been inserted, it can tell us either "no" or "maybe". -Both insertion and search are `O(1)` operations. +Both insertion and search are `O(k)` operations. ## Making the filter