The Quicksort algorithm
A) is in O(n)in the worst case
B) is in O(n log n.in the worst case
C) is in O(n log n.in the average case
D) is in O(log n.in the average case

Name: The Quicksort algorithm A) is in O(n)in the worst case B) is in O(n log n.in the worst case C) is in O(n log n.in the average case D) is in O(log n.in the average case
Brand: Quizplus
Rating: 4.9 (35 reviews)

Question

Quizplus · Accepted Answer

Quicksort has an average time complexity of O(n log n), but its worst-case time complexity is O(n^2).

The Quicksort Algorithm