A Ruby implementation of the HyperLogLog algorithm for efficient cardinality estimation with minimal memory footprint. Count millions of distinct elements using only kilobytes of memory.
-
Updated
Mar 24, 2025 - Ruby
A Ruby implementation of the HyperLogLog algorithm for efficient cardinality estimation with minimal memory footprint. Count millions of distinct elements using only kilobytes of memory.
Task solutions from "Alghoritms and data structures" course on AGH UST 2023/2024
Add a description, image, and links to the alghoritms topic page so that developers can more easily learn about it.
To associate your repository with the alghoritms topic, visit your repo's landing page and select "manage topics."