Sorting

Question 70

Consider an array of positive integers between 123456 to 876543, which sorting algorithm can be used to sort these number in linear time?

A	Impossible to sort in linear time
B	Radix Sort
C	Insertion Sort
D	Bubble Sort

Question 70 Explanation:

Radix Sort worst case time complexity is O(d(n+k)).
Even it gives linear time when the input array is 0 to n^6….

Correct Answer: B

Question 70 Explanation:

Radix Sort worst case time complexity is O(d(n+k)).
Even it gives linear time when the input array is 0 to n^6….