MeteoriteSort is an efficient Shell Sort algorithm.
-
Updated
Nov 26, 2025 - C#
#
space-efficient
Here are 6 public repositories matching this topic...
RecoilSort is an efficient stable Binary Insertion Sort algorithm.
-
Updated
Dec 4, 2025 - C#
Space-efficient maplet data structures for approximate key-value mappings - Rust implementation with Python bindings
rust performance algorithms key-value pypi bloom-filter data-structures cargo python-bindings crates-io memory-efficient probabilistic systems-programming approximate space-efficient false-positives membership-testing maplet
-
Updated
Nov 16, 2025 - Rust
Fast Bloom filter using 128-bit MurmurHash3 with double hashing using Kirsch-Mitzenmacher technique. Optimal parameters auto-calculated. Works in Node.js and browsers.
nodejs typescript bloom-filter space-efficient set-membership probabilistic-data-structure hash-function murmur-hash
-
Updated
Dec 1, 2025 - TypeScript
Space-efficient Merkle tree designed for linear appends with witnessing of marked leaves.
-
Updated
Oct 4, 2025 - Rust
Space-efficient approximate mappings using perfect hash functions. Supports arbitrary function approximation (X→Y) with configurable storage (8/16/32/64-bit) and accuracy trade-offs.
bloom-filter hash-functions data-structures python-bindings header-only cpp17 perfect-hash probabilistic-data-structures approximate-computing space-efficient
-
Updated
Oct 2, 2025 - C++
Improve this page
Add a description, image, and links to the space-efficient topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the space-efficient topic, visit your repo's landing page and select "manage topics."