Lib.rs

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

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

3 releases (breaking)

new 0.4.0 Mar 5, 2025
0.2.0 Sep 29, 2024
0.1.0 Sep 19, 2024

#562 in Algorithms

Download history 6420/week @ 2024-11-15 7375/week @ 2024-11-22 8302/week @ 2024-11-29 8759/week @ 2024-12-06 7983/week @ 2024-12-13 5560/week @ 2024-12-20 5840/week @ 2024-12-27 13638/week @ 2025-01-03 11764/week @ 2025-01-10 11104/week @ 2025-01-17 12500/week @ 2025-01-24 12538/week @ 2025-01-31 16535/week @ 2025-02-07 14795/week @ 2025-02-14 13896/week @ 2025-02-21 14665/week @ 2025-02-28

62,420 downloads per month
Used in 61 crates (via i_overlay)

MIT license

9KB
213 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