0:00 / 0:00
- Recommended by 2 people: 1 on Lobsters and 1 curated list.
Beginner. No background in the topic needed.
36K views12 years ago2 recommendations
Computer scienceData structuresAlgorithms
An animated explanation of how Bloom filters work, including their probabilistic nature and hash functions.
For more information on Bloom Filters, check the Wikipedias: en.wikipedia.org/wiki/Bloom_filter , for special topics like "How to get around the 'no deletion' rule" and "How do I generate all of these different hash functions anyways?" For other questions, like "who taught you how to do math?" and "why are your drawings so shaky and awful", there's always comments!Why it's here
2 people recommend thisWhat people say. Recommended as a clear and accessible visual introduction to Bloom filters.
Coding Interview Universitycurated list on GitHubRecommends
Under “Additional Learning”
Bloom Filters (video)