data structures using in the third passthe numbers are sorted according to the digit at the hundreds place the buckets are pictured upside down number the numbers are collected bucket by bucket the new list thus formed is the final sorted result after the third passthe list can be given as complexity of radix sort to calculate the complexity of radix sort algorithmassume that there are numbers that have to be sorted and is the number of digits in the largest number in this casethe radix sort algorithm is called total of times the inner loop is executed times hencethe entire radix sort algorithm takes (kntime to execute when radix sort is applied on data set of finite size (very small set of numbers)then the algorithm runs in (nasymptotic time pros and cons of radix sort radix sort is very simple algorithm when programmed properlyradix sort is one of the fastest sorting algorithms for numbers or strings of letters but there are certain trade-offs for radix sort that can make it less preferable as compared to other sorting algorithms radix sort takes more space than other sorting algorithms besides the array of numberswe need buckets to sort numbers buckets to sort strings containing only charactersand at least buckets to sort string containing alphanumeric characters another drawback of radix sort is that the algorithm is dependent on digits or letters this feature compromises with the flexibility to sort input of any data type for every different data typethe algorithm has to be rewritten even if the sorting order changesthe algorithm has to be rewritten thusradix sort takes more time to write and writing general purpose radix sort algorithm that can handle all kinds of data is not trivial task radix sort is good choice for many programs that need fast sortbut there are faster sorting algorithms available this is the main reason why radix sort is not as widely used as other sorting algorithms programming example write program to implement radix sort algorithm ##include #include #define size int largest(int arr[]int )void radix_sort(int arr[]int )void main(