Analyzing Heapify(): Formal Fixing up relationships between i, 1, and r takes (1) time • If the heap at i has n elements, how many elements can the subtrees at l or r have? ■Draw it • Answer: 2n/3 (worst case: bottom row 1/2 full) • So time taken by Heapify () is given by T(n)T(2n/3) + (1) provide proof

C++ Programming: From Problem Analysis to Program Design
8th Edition
ISBN:9781337102087
Author:D. S. Malik
Publisher:D. S. Malik
Chapter17: Linked Lists
Section: Chapter Questions
Problem 3SA
icon
Related questions
Question

How can I provide a proof for this question regarding the Heapify function for Heapsort?

Analyzing Heapify(): Formal
Fixing up relationships between i, 1, and r
takes (1) time
• If the heap at i has n elements, how many
elements can the subtrees at l or r have?
■Draw it
• Answer: 2n/3 (worst case: bottom row 1/2 full)
• So time taken by Heapify () is given by
T(n)T(2n/3) + (1)
provide
proof
Transcribed Image Text:Analyzing Heapify(): Formal Fixing up relationships between i, 1, and r takes (1) time • If the heap at i has n elements, how many elements can the subtrees at l or r have? ■Draw it • Answer: 2n/3 (worst case: bottom row 1/2 full) • So time taken by Heapify () is given by T(n)T(2n/3) + (1) provide proof
Expert Solution
steps

Step by step

Solved in 2 steps with 1 images

Blurred answer
Recommended textbooks for you
C++ Programming: From Problem Analysis to Program…
C++ Programming: From Problem Analysis to Program…
Computer Science
ISBN:
9781337102087
Author:
D. S. Malik
Publisher:
Cengage Learning
New Perspectives on HTML5, CSS3, and JavaScript
New Perspectives on HTML5, CSS3, and JavaScript
Computer Science
ISBN:
9781305503922
Author:
Patrick M. Carey
Publisher:
Cengage Learning
Systems Architecture
Systems Architecture
Computer Science
ISBN:
9781305080195
Author:
Stephen D. Burd
Publisher:
Cengage Learning
Programming Logic & Design Comprehensive
Programming Logic & Design Comprehensive
Computer Science
ISBN:
9781337669405
Author:
FARRELL
Publisher:
Cengage
Operations Research : Applications and Algorithms
Operations Research : Applications and Algorithms
Computer Science
ISBN:
9780534380588
Author:
Wayne L. Winston
Publisher:
Brooks Cole
C++ for Engineers and Scientists
C++ for Engineers and Scientists
Computer Science
ISBN:
9781133187844
Author:
Bronson, Gary J.
Publisher:
Course Technology Ptr