Radix Sort
Visualize how integer arrays are sorted digit by digit using counting sort as a subroutine.
Free theory articleVisualize how integer arrays are sorted digit by digit using counting sort as a subroutine.
Concept & interpretation
Radix Sort is a non-comparative integer sorting algorithm that sorts data with integer keys by grouping keys by the individual digits which share the same significant position and value. A positional notation is required, but because integers can represent strings of characters (e.g., names or dates) and specially formatted floating point numbers, radix sort is not limited to integers. It works by processing individual digits from the least significant digit (LSD) to the most significant digit (MSD) or vice versa, typically utilizing Counting Sort as a stable subroutine for sorting each digit.