Lib.rs

› Algorithms
#sorting #primary-key #algorithm #counting #scenario #combining #bin

i_key_sort

A fast sorting algorithm combining bin and counting sort. Optimized for scenarios where a primary key can be extracted to index elements into buckets.

by NailxSharipov

2 unstable releases

0.2.0 Sep 29, 2024
0.1.0 Sep 19, 2024

#661 in Algorithms

Download history 158/week @ 2024-09-19 575/week @ 2024-09-26 267/week @ 2024-10-03 56/week @ 2024-10-10 74/week @ 2024-10-17 399/week @ 2024-10-24 5571/week @ 2024-10-31 6468/week @ 2024-11-07 6309/week @ 2024-11-14 7382/week @ 2024-11-21 7955/week @ 2024-11-28 9048/week @ 2024-12-05 7959/week @ 2024-12-12 5980/week @ 2024-12-19 4582/week @ 2024-12-26 11173/week @ 2025-01-02

31,008 downloads per month
Used in 46 crates (via i_overlay)

MIT license

7KB
159 lines

iKeySort

A fast sorting algorithm combining bin and counting sort. Optimized for scenarios where a primary key can be extracted to index elements into buckets.

No runtime deps