= Flajolet–Martin algorithm
{wiki=Flajolet–Martin_algorithm}
The Flajolet-Martin algorithm is a probabilistic algorithm used for estimating the number of distinct elements in a large dataset (or stream of data). It is particularly useful in scenarios where storing all elements is impractical due to memory constraints. The algorithm leverages randomness and hashing to provide a count of unique elements with a probabilistic guarantee. \#\#\# Key Concepts: 1. **Hashing**: The algorithm uses a hash function to map elements to a fixed-size integer space.
Back to article page
