Update README.md

berkay-dincer · Nov 13, 2019 · 205513b · 205513b
1 parent 52365db
commit 205513b
Showing 1 changed file with 1 addition and 1 deletion.
diff --git a/README.md b/README.md
@@ -3,7 +3,7 @@ A probabilistic data structure called Bloom Filter implemented in python.
 
 Bloom Filters are very efficient data structures built for set membership problems. They take sublinear memory space with O(k) complexity for inserting and checking membership.
 
-This implementation calculates the k (# of hash functions) and m (# of bits) from m (capacity) and p (error_rate):
+This implementation calculates the `k` (# of hash functions) and `m` (# of bits) from a given `m` (capacity) and `p` (error_rate):
 
 - m = ceil((n * log(p)) / log(1 / pow(2, log(2))))
 - k = round((m / n) * log(2))