Question: 10. Radix-sort is another application uses hash table for sorting. (a) What is the hash function used in Radix-sort? (1) (b) Why do we use
10. Radix-sort is another application uses hash table for sorting. (a) What is the hash function used in Radix-sort? (1) (b) Why do we use only 10 buckets in Radix-sort to sort integers? (1) (c) How many buckets do we need when sorting strings? (1) (d) How many hash tables do we need in Radix-sort for sorting strings. (1) (e) What is the time complexity of Radix-sort for sorting a list of N positive integers. Explain your answer. (2)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
