retagged by
2,692 views

4 Answers

0 votes
0 votes
Quick sort is less efficient that heap sort because quick sort takes O(n^2) while heap sort takes O(nlogn).

Related questions

8 votes
8 votes
1 answer
1
37 votes
37 votes
10 answers
3
Kathleen asked Sep 12, 2014
17,313 views
Complexity of Kruskal’s algorithm for finding the minimum spanning tree of an undirected graph containing $n$ vertices and $m$ edges if the edges are sorted is _______
13 votes
13 votes
5 answers
4
go_editor asked Dec 20, 2016
3,235 views
Solve the recurrence equations:$T(n)= T( \frac{n}{2})+1$$T(1)=1$