| Home | Libraries | People | FAQ | More

### Rationale

#### Radix Sorting

Radix-based sorting allows the data to be divided up into more than 2 pieces per iteration, and for cache-friendly versions, it normally cuts the data up into around a thousand pieces per iteration. This allows many fewer iterations to be used to complete sorting the data, enabling performance superior to the 𝑶(N*log(N)) comparison-based sorting limit.