Prove that the worst case efficiency of quick sort is $o(n^2)$

Welcome back.

and 5 others joined a min ago.

2.0kviews

written 6.4 years ago by

modified 2.3 years ago by

Subject: Analysis Of Algorithm

Topic: Divide Aqnd Conquer

Difficulty: Medium

ADD COMMENT EDIT

1 Answer

17views

written 2.3 years ago by

• modified 2.3 years ago

Quick Sort : - It is a sorting method.

To Prove :- Worst case efficiency of quick sort is $o(n^2)$

Proof :- The partitioning step: at least, n − 1 comparisons.

and 3 others joined a min ago.

ADD COMMENT EDIT

Community

Content

Company