Radix Sort
Sort integer or string keys by processing one digit, byte, or character position at a time.
6 notes
Sort integer or string keys by processing one digit, byte, or character position at a time.
Radix sort for signed integers by transforming values to preserve ordering across negative and positive ranges.
Sort values by mapping them to a dense rank space and ordering by compressed indices.
Extend counting sort to handle negative integers by shifting keys into a nonnegative index range.
Sample sort specialized for integer keys using range-based partitioning and optional radix-style bucket classification.
Sort integers by counting occurrences of each key and reconstructing the output in linear time.