Register

heapsort

• retagged by
305 views
1 votes
1 votes
I have read that for heapify, t(n) = t(2n/3) +o(1) and i know the no. of nodes in the subtree will be 2n/3(worst case) but the algo actually be applied to logn elements down the subtree so isn't it should be t(log n) instead of t(2n/3)?
if anybody know then plz clear my doubt
• retagged by
User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
1 answer
2
iarnav asked Jun 20, 2018
698 views
#Algorithms Can Heapsort be applied on Min Heap Data Structure?
I've read and been told that Heapsort can only be applied on Max heap, but this article for G4G states otherwise - https://www.geeksforgeeks.org/heap-sort-for-decreasing-order-using-min-heap/ So, is it true that HS can be applied also on Min heap?
I've read and been told that Heapsort can only be applied on Max heap, but this article for G4G states otherwise - https://www.geeksforgeeks.org/heap-sort-for-decreasing-...
User Avatar
1 votes
1 votes
0 answers
3
Prajwal Bhat asked Dec 20, 2016
605 views
Heapsort #Virtualgate
Need approach to solve this ?
Need approach to solve this ?
User Avatar
2 votes
2 votes
0 answers
4
bhuv asked Jul 5, 2017
491 views
CLRS Heapsort, number of nodes of height h ?
Number of node of height h in a binary tree is given as ceiling (n/2^(h+1)) from where this formula come ? I've only found proof by induction or solving for a particular case to say it is true. But didn't get what going behind it.
Number of node of height h in a binary tree is given as ceiling (n/2^(h+1)) from where this formula come ? I've only found proof by induction or solving for a particular ...
User Avatar
Link Copied!