Register

Cormen Edition 3 Exercise 6.2 Question 5 (Page No. 156)

296 views
0 votes
0 votes

The code for MAX-HEAPIFY is quite efficient in terms of constant factors, except possibly for the recursive call in line 10, which might cause some compilers to produce inefficient code. Write an efficient MAX-HEAPIFY that uses an iterative control construct (a loop) instead of recursion.

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
0 answers
1
akash.dinkar12 asked Jun 26, 2019
259 views
Cormen Edition 3 Exercise 6.2 Question 6 (Page No. 156)
Show that the worst-case running time of MAX-HEAPIFY on a heap of size $n$ is $\Omega(lg\ n)$.(Hint: For a heap with $n$ nodes, give node values that cause MAXHEAPIFY to be called recursively at every node on a simple path from the root down to a leaf).
Show that the worst-case running time of MAX-HEAPIFY on a heap of size $n$ is $\Omega(lg\ n)$.(Hint: For a heap with $n$ nodes, give node values that cause MAXHEAPIFY to ...
User Avatar
0 votes
0 votes
0 answers
2
akash.dinkar12 asked Jun 26, 2019
180 views
Cormen Edition 3 Exercise 6.2 Question 4 (Page No. 156)
What is the effect of calling MAX-HEAPIFY$(A,i)$ for $i > A.heapsize/2$.
What is the effect of calling MAX-HEAPIFY$(A,i)$ for $i A.heapsize/2$.
User Avatar
0 votes
0 votes
0 answers
3
akash.dinkar12 asked Jun 26, 2019
173 views
Cormen Edition 3 Exercise 6.2 Question 3 (Page No. 156)
What is the effect of calling MAX-HEAPIFY$(A, i)$ when the element $A[i]$ is larger than its children?
What is the effect of calling MAX-HEAPIFY$(A, i)$ when the element $A[i]$ is larger than its children?
User Avatar
0 votes
0 votes
0 answers
4
akash.dinkar12 asked Jun 26, 2019
333 views
Cormen Edition 3 Exercise 6.2 Question 2 (Page No. 156)
Starting with the procedure MAX-HEAPIFY, write pseudocode for the procedure MIN-HEAPIFY$(A, i )$, which performs the corresponding manipulation on a minheap. How does the running time of MIN-HEAPIFY compare to that of MAXHEAPIFY?
Starting with the procedure MAX-HEAPIFY, write pseudocode for the procedure MIN-HEAPIFY$(A, i )$, which performs the corresponding manipulation on a minheap. How does the...
User Avatar
Link Copied!