Worst -case of Quicksort algorithm occurs when
A
Data are sorted
B
Data are random
C
Number of items is low
D
None of the above
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.