Radix sort is a non-comparative integer sorting algorithm that processes numbers digit by digit, starting from the least significant digit to the most significant. It is efficient for sorting large lists of integers, especially when the range of the numbers is not significantly greater than the number of items to be sorted.