Question

average case, best case and worst case of quick sort in c
​

Answer 1

Answer:

Mathematical analysis of quicksort shows that, on average, the algorithm takes O(n log n) comparisons to sort n items. In the worst case, it makes O(n2) comparisons, though this behavior is rare.