Vidyalelo
Data Structure · Q262

Sorting Algorithms

Programming · Data Structure · question 262

Q262

What is the best case time complexity Median of three quick sort?

A.
O(log n)
B.
O(n log n)
Answer
C.
O(n2)
D.
O(n2 log n)

Answer: Option B

Solution

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