<ul><li>Radix sort algorithm is an interesting sorting algorithm. Because this sort is not based on comparison, rather than it is based on buckets.</li><li>Radix Sort is a linear sort algorithm. The number of passes depends upon the number of digits in the maximum number in the array.</li><li>The steps for performing Radix Sort include creating buckets, placing the elements in the buckets based on their digits, and repeating this process until all passes are complete.</li><li>The implementation of Radix Sort in C involves finding the maximum element in the array, creating buckets for each digit, performing counting sort for each digit place, and updating the original array.</li></ul>

Sorting algorithm 9: Radix Sort

Discover more