retagged by
581 views

2 Answers

Best answer
4 votes
4 votes

If you have any doubt, then leave comment. I think it is self explanatory. 

Source: Wikipedia

selected by
2 votes
2 votes
Quick sort  worst case  O(n^2)

avg case and best  case O(nlogn)

Related questions

0 votes
0 votes
1 answer
1
0 votes
0 votes
2 answers
2
0 votes
0 votes
1 answer
3
akash.dinkar12 asked Jun 27, 2019
1,063 views
Show that the running time of QUICKSORT is $\Theta(n^2)$ when the array $A$ contains distinct elements and is sorted in decreasing order.
1 votes
1 votes
2 answers
4