A non-comparative sorting algorithm that sorts numbers by processing individual digits, starting from the least significant digit to the most.
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. It processes the digits either from least significant digit (LSD) or most significant digit (MSD). Radix sort is efficient for sorting large numbers of integers with a limited range of digits.