Radix Sort is a non-comparative algorithm that sorts numbers digit by digit from least to most significant, using buckets to group them.
Processes digits or characters individually
Uses counting sort as a subroutine
Well-suited for integers or fixed-length strings
Has stable sorting capabilities
Radix Sort is efficient for integers and strings but may require extra space