What is the worst case running time of quick sort algorithm?
- AΘ(x)
- BΘ(x2)
- CΘ(x log2x)
- DΘ(x log2x2)
Correct answer: B
Explanation
The worst case of quick sort occurs for already sorted input, giving O(n²), i.e. Θ(x²). Discussion 0
Nobody has replied yet. Start the discussion!