Login/RegisterData Structures :: Searching & Sorting - Discussion
Home > Data Structures > Searching & Sorting > MCQs Questions Discussion
7 / 69
Choose the correct option.
In worst case Quick Sort has order
AO(n log n)
B\(O\left(n^{2}\right)\)
CO(log n)
D\(O\left(\frac{n^{2}}{4}\right)\)
Answer: Option (Login/Signup)
Show Explanation
Asked In ::
TRICK
The worst case time complexity of a typical implementation of QuickSort is O(n2)
Read Full Answer
Report Error
Please Login First Click Here
