Worst -case of Quicksort algorithm occurs when

Worst -case of Quicksort algorithm occurs when Correct Answer Data are random

Quicksort (sometimes called partition – exchange sort) is an efficient sorting algorithm, Quicksort is a comparison sort. In the worst case, it make O (n2) comparisons, though this behavior is rate.
Bissoy MCQ

Related Questions

What is the best case complexity of QuickSort?
What hole will allocates in "Worst-Fit" algorithm of memory management?
Water-logging is one of the worst problems in our country. (Positive)
Which one is the comparative form of worst?
The worst nuclear power plant accident so far occurred in -
Adversities bring in the best and worst in different human beings.