In-Place Radix Sort for DNA Sequences
In-Place Radix Sort for DNA Sequences: a task in Terminal-Lego-15k (Harbor dataset). Implement an in-place radix sort algorithm for sorting DNA sequences. DNA sequences consist only of the characters "A", "C", "G", and "T", which makes them ideal candidates for radix sort optimization.
The task
Implement an **in-place radix sort algorithm** for sorting DNA sequences. DNA sequences consist only of the characters "A", "C", "G", and "T", which makes them ideal candidates for radix sort optimization.
Part of PrimeIntellect/Terminal-Lego-15k.