Given the radix sort algorithm to sort an array A of decimal numbers, each has d digits: RADIX-SORT(A, n, d) 1 for i = 1 to d 2 use a stable sort to sort array A[1:n] on digit i 1. Analyze the complexity of the algorithm to show whether it is a linear time algorithm. 2. Can we use the radix sort algorithm to sort an array of strings? If yes, then how?.
Given the radix sort algorithm to sort an array A of decimal numbers, each has d digits: RADIX-SORT(A, n, d) 1 for i = 1 to d 2 use a stable sort to sort array A[1:n] on digit i 1. Analyze the complexity of the algorithm to show whether it is a linear time algorithm. 2. Can we use the radix sort algorithm to sort an array of strings? If yes, then how?.