What is the best case complexity of QuickSort?
A
O(nlogn)
B
O(logn)
C
O(n)
D
O(n2)
Correct Answer: O(nlogn)
The array is partitioned into equal halves, using the Divide and Conquer master theorem, the complexity is found to be O(nlogn).