Skip to content

Latest commit

 

History

History
25 lines (16 loc) · 909 Bytes

README.md

File metadata and controls

25 lines (16 loc) · 909 Bytes

Experiments with Radix Sorting Strings in C and C++

Various MSD radix sorting implementations, for fun and evaluation.

The plan is for some to eventually join my Notes on Radix Sorting and Implementation repository.

All code is provided under the MIT License.

Variant synopsis

  • CE is for Count, External memory.
  • CI is for Count, In-place.
  • CB have merged C (count) and B (bucket) arrays.
  • BM Use bitmaps for loop iteration.

Notes

None of the current implementations are really competitive, especially considering the extra space for the non-inplace variants. For sure, the memory access pattern is suboptimal for modern architectures, especially at relatively low radixes (i.e 8 bits).

Sources