Register

Doubt : tifr

• retagged by
164 views
0 votes
0 votes

Only build heap will not satisfy the given condition. I guess condition says that array should me halfway sorted ( a[i/2] <= a[i] ).

Using build heap only : 

But  array is not halway sorted so it still needs n/2logn time to do so. 

This is what i think.

Help in this.

• 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

1 votes
1 votes
1 answer
2
iarnav asked Jun 21, 2018
474 views
#DataStructure Heaps Self Doubt.
In a binary Heap of 100 elements time taken to find the 99th element? or in a binary heap on "n" elements, time taken to find (n-1)th element? Note ; I'm not asking about smallest or largest, but simply the 99th element.
In a binary Heap of 100 elements time taken to find the 99th element?or in a binary heap on "n" elements, time taken to find (n-1)th element? Note ; I'm not asking about ...
User Avatar
0 votes
0 votes
1 answer
3
syedasafoora asked Nov 8, 2023
251 views
Consider the following algorithm for Build-Max-heap and the given array A=[ 47, 96, 35, 54, 77, 65, 83]. Run this algorithm on the given array and redraw the heap and the heap- array whenever the swapping takes place. dry run this statement
Consider the following algorithm for Build-Max-heap and the given array A=[ 47,96, 35, 54, 77, 65, 83]. Run this algorithm on the given array and redraw the heap and the ...
User Avatar
1 votes
1 votes
1 answer
4
jola asked Dec 5, 2022
429 views
CS Data structures and algorithm 2022
Design an algorithm to construct one heap that contains all the elements of two given heaps of sizes n and m, respectively. The heaps are given in a linked-list representation ( each node has links to its two children). The running time of the algorithm should be O(log(m + n)) in the worst case
Design an algorithm to construct one heap that contains all the elements of two given heaps of sizes n and m, respectively. The heaps are given in a linked-list represent...
User Avatar
Link Copied!