1. We can build a heap by repeatedly calling MAX-HEAP-INSERT to insert the ele- ments into the heap. Consider the following variation on the BUILD-MAX-HEAP procedure: BUILD MAX HEAP' (A) 1 A. heap_size=1 2 for i=2 to A. length 3 MAX HEAP INSERT (A, A[i]) (a) (10 points) Do the procedures BUILD-MAX-HEAP and BUILD-MAX-HEAP' always create the same heap when run on the same input array? Prove that they do, or provide a counterexample. (b) (10 points) Show that in the worst case, BUILD-MAX-HEAP' requires (nlgn) time to build an n-element heap.

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question
1. We can build a heap by repeatedly calling MAX-HEAP-INSERT to insert the ele- ments into the heap.
Consider the following variation on the BUILD-MAX-HEAP procedure:
BUILD MAX HEAP' (A)
1 A. heap_size=1
2 for i=2 to A. length
3
MAX HEAP INSERT (A, A[i])
(a) (10 points) Do the procedures BUILD-MAX-HEAP and BUILD-MAX-HEAP' always create the
same heap when run on the same input array? Prove that they do, or provide a counterexample.
(b) (10 points) Show that in the worst case, BUILD-MAX-HEAP' requires (nlgn) time to build an
n-element heap.
Transcribed Image Text:1. We can build a heap by repeatedly calling MAX-HEAP-INSERT to insert the ele- ments into the heap. Consider the following variation on the BUILD-MAX-HEAP procedure: BUILD MAX HEAP' (A) 1 A. heap_size=1 2 for i=2 to A. length 3 MAX HEAP INSERT (A, A[i]) (a) (10 points) Do the procedures BUILD-MAX-HEAP and BUILD-MAX-HEAP' always create the same heap when run on the same input array? Prove that they do, or provide a counterexample. (b) (10 points) Show that in the worst case, BUILD-MAX-HEAP' requires (nlgn) time to build an n-element heap.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 2 images

Blurred answer
Knowledge Booster
Heapsort
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education