Suppose you wish to sort a sequence of 1000 numbers, each of which is an RSA encryption key with 300 decimal digits. How many rounds would be needed to sort them using radix sort, if each round involves bucket sorting with 1000 buckets? Would radix sorting be achoice for this application than a general purpose comparison sorting routine?

Given an array where numbers are in range from 1 to n6, which sorting algorithm can be used to sort these number in linear time?

If we use Radix Sort to sort n integers in the range (nk/2,nk], for some k>0 which is independent of n, the time taken would be?

If there are n integers to sort, each integer has d digits, and each digit is in the set {1, 2, ..., k}, radix sort can sort the numbers in?