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

#712 in Algorithms

Download history 76/week @ 2024-10-08 65/week @ 2024-10-15 232/week @ 2024-10-22 3208/week @ 2024-10-29 6884/week @ 2024-11-05 5959/week @ 2024-11-12 6668/week @ 2024-11-19 8156/week @ 2024-11-26 8938/week @ 2024-12-03 7876/week @ 2024-12-10 7751/week @ 2024-12-17 4612/week @ 2024-12-24 9890/week @ 2024-12-31 12323/week @ 2025-01-07 11904/week @ 2025-01-14 9628/week @ 2025-01-21

44,623 downloads per month
Used in 49 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