From c132d501b61cf4f45dd8e7761d1320acf388d015 Mon Sep 17 00:00:00 2001 From: isidroas Date: Sat, 8 Apr 2023 16:06:50 +0200 Subject: [PATCH] Update data_structures/hashing/bloom_filter.py Co-authored-by: Christian Clauss --- data_structures/hashing/bloom_filter.py | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/data_structures/hashing/bloom_filter.py b/data_structures/hashing/bloom_filter.py index 51ba916a4..de4f7dc23 100644 --- a/data_structures/hashing/bloom_filter.py +++ b/data_structures/hashing/bloom_filter.py @@ -2,7 +2,7 @@ See https://en.wikipedia.org/wiki/Bloom_filter The use of this data structure is to test membership in a set. -Compared to python built-in set() it is more space-efficent. +Compared to Python's built-in set() it is more space-efficient. In the following example, only 8 bits of memory will be used: >>> b = Bloom(size=8) >>> "Titanic" in b