Vidyalelo
Data Structure · Q705

Miscellaneous on Data Structures

Programming · Data Structure · question 705

Q705

What is the worst case time complexity of quickselect?

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

Answer: Option B

Solution

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