When does quicksort's worst-case run-time behavior occur?
I when the data is randomly initialized in the array
II when the data is in ascending order
III when the data is in descending order
A) I
B) II
C) III
D) II and III

Question

Quizplus · Accepted Answer

Quicksort's worst-case run-time occurs when the pivot selection results in highly unbalanced partitions. This often happens when the data is already sorted in ascending or descending order, leading to O(n^2) complexity.

When Does Quicksort's Worst-Case Run-Time Behavior Occur