Question

Analyze quick sort algorithm in best case and worst case and average

Answer 1

It is very similar to selection sort, except that it does not always choose worst-case partition. 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.

Answer 2

Explanation:

analyse Quicksort algorithm is best case and worst case