申論題

9. For any input of size n and assuming that ki denotes the maximum number of digits and Iz the number of buckets, what is the average-case running time of each of the following sorting algorithms: (a) selection sort, (b) merge sort, (c) heap sort, (d) radix sort, and (e) bucket sort?