In-Place Radix Sort

Question

This is a long text. Please bear with me. Boiled down, the question is: Is there a workable in-place radix sort algorithm?

---

Preliminary

Answer 1

Radix-Sort is not cache conscious and is not the fastest sort algorithm for large sets. You can look at:

• ti7qsort. ti7qsort is the fastest sort for integers (can be used for small-fixed size strings).
• Inline QSORT
• String sorting

You can also use compression and encode each letter of your DNA into 2 bits before storing into the sort array.