Vidyalelo
Data Structure · Q472

Sorting Algorithms

Programming · Data Structure · question 472

Q472

Which of the following is incorrect about randomized quicksort?

A.
it has the same time complexity as standard quick sort
B.
it has the same space complexity as standard quick sort
C.
it is an in-place sorting algorithm
D.
it cannot have a time complexity of O(n2) in any case.
Answer

Answer: Option D

Solution

Answer: Option D
No explanation is given for this question Let's Discuss on Board