In the worst case, quicksort is a(n) ____ algorithm. A) O(n) B) O(log(n)) C) O(n²) D) O(n log n)

Name: In the worst case, quicksort is a(n) ____ algorithm. A) O(n) B) O(log(n)) C) O(n 2 ) D) O(n log n)
Brand: Quizplus
Rating: 4.9 (41 reviews)

Question

Quizplus · Accepted Answer

In the worst case, quicksort has a time complexity of O(n^2), which occurs when the pivot selection results in highly unbalanced partitions, such as when the smallest or largest element is consistently chosen as the pivot.

In the Worst Case, Quicksort Is A(n) ____ Algorithm