<p><pre><code> filter, so we pass it through hash 1 – returns 33, hash 2 – returns 7 and hash 3 – returns 22. Next we go to each of those elements in the array and set them to 1,
</code></pre>
I think the diagram was poor shortly below this line, it didn't even match up with what you were saying above, making me confused. I enjoyed wikipedia's algo desc better: <a href="http://en.wikipedia.org/wiki/Bloom_filter#Algorithm_description" rel="nofollow">http://en.wikipedia.org/wiki/Bloom_filter#Algorithm_descript...</a><p>Good article in the end though!