Question

What is the purpose of using randomized quick sort over standard quick sort?

(a) so as to avoid worst case time complexity

(b) so as to avoid worst case space complexity

(c) to improve accuracy of output

(d) to improve average case time complexity

This question was addressed to me during an interview for a job.

My question is from Sorting topic in portion Sorting of Data Structures & Algorithms II

Answer 1

Right choice is (a) so as to avoid worst case time complexity

To explain: Randomized quick sort helps in avoiding the worst case time complexity of O(n2) which occurs in case when the input array is already sorted. However the average case and best case time complexities remain unaltered.