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

#681 in Algorithms

Download history 142/week @ 2024-09-17 388/week @ 2024-09-24 442/week @ 2024-10-01 76/week @ 2024-10-08 65/week @ 2024-10-15 232/week @ 2024-10-22 3208/week @ 2024-10-29 5331/week @ 2024-11-05

8,855 downloads per month
Used in 11 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