News for hackers. Stuff that matters.

A comment on Engineering Faster Sorters for Small Sets of Items. Parent comment

Re:Engineering Faster Sorters for Small Sets of Items by matt_d on Friday February 14, 2020 @06:27PM (#22331474)
Perhaps it's worth considering succinct data structures (https://en.wikipedia.org/wiki/Succinct_data_structure), e.g.:

- BitMagic: http://bitmagic.io/, https://github.com/tlk00/BitMagic

- Succinct Data Structure Library 2.0: https://github.com/simongog/sdsl-lite, https://github.com/simongog/sdsl-lite/wiki/Literature

[ Parent | on HN ]
Re:Engineering Faster Sorters for Small Sets of Items by renox on Saturday February 15, 2020 @02:13AM (#22333859)
Thanks but these structures are size optimised, I'm looking for CPU usage optimised structures.
[ Parent | on HN ]