Question

Which of the following is true for the LSD radix sort?

(a) works best for variable length strings

(b) accesses memory randomly

(c) inner loop has less instructions

(d) sorts the keys in left-to-right order

The question was posed to me in examination.

My query is from Sorting topic in division Sorting of Data Structures & Algorithms II

Answer 1

Right choice is (b) accesses memory randomly

The explanation is: LSD radix sort sorts the keys in right-to-left order, working with Least Significant Digit first. The inner loop has a lot of instructions and LSD radix sort is used to sort fixed-length strings.