LSD Radix Sort Multiple choice Questions and Answers (MCQs)
Which of the following is the distribution sort?
LSD radix sort
Question 1 Explanation:
In Distribution sort the inputted values are distributed to multiple intermediate structures which are then combined and placed on the output. And LSD radix sort distributes values into buckets based on the digits within values, so it is a distribution sort.
What is the worst case time complexity of LSD radix sort?
O(n + w)
Question 2 Explanation:
Time complexity of LSD radix sort depends upon the word size and the number on items. It runs in O(wn) time in worst case, where n is the number of inputted elements and w is the number of digits in the largest number.
LSD radix sort requires ..... passes to sort N elements.
Question 3 Explanation:
LSD radix sort sorts the N elements in (w/logR) passes where w is the number of digits in largest number and R(radix) is extra space required for performing the sorting operation.
Which of the following is false?
LSD radix sort is an integer sorting algorithm
LSD radix sort is a comparison sorting algorithm
LSD radix sort is a distribution sort
LSD radix sort uses bucket sort
Question 4 Explanation:
LSD radix sort uses bucket sort for grouping the keys based on the digits at that value. And as it grouped the keys based on the digits at that values, it is integer sorting algorithm.
Which of the following sorting algorithm is stable?
In-place MSD radix sort
LSD radix sort
Question 5 Explanation:
In LSD radix sort after sorting the multiple elements with the same key will be in the same order as they were in the input array. So LSD radix sort is stable sort.
There are 5 questions to complete.