In BUILD-MAX-HEAP, we can use insert method similar to insert binary tree to build heap. 1- write pseudo code to build a heap using insert method, name your function (method) as INSERT-MAX-HEAP(A,A[i]) 2- what will be the most efficient complexity for INSERT- MAX-HEAP (A,A[i]) 3- will INSERT-MAX-HEAP(A,A[i]) be the same as BUILD- MAX-HEAP(A) 4-can we modify the Heapsort to run in a time less than O(nlgn)? why?

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
In BUILD-MAX-HEAP, we can use insert method similar to
insert binary tree to build heap.
1- write pseudo code to build a heap using insert method,
name your function (method) as INSERT-MAX-HEAP (A,A[j)
2- what will be the most efficient complexity for INSERT-
MAX-HEAP (A,A[i])
3- will INSERT-MAX-HEAP(A,A[i]) be the same as BUILD-
MAX-HEAP(A)
4-can we modify the Heapsort to run in a time less than
O(nlgn)? why?
Transcribed Image Text:In BUILD-MAX-HEAP, we can use insert method similar to insert binary tree to build heap. 1- write pseudo code to build a heap using insert method, name your function (method) as INSERT-MAX-HEAP (A,A[j) 2- what will be the most efficient complexity for INSERT- MAX-HEAP (A,A[i]) 3- will INSERT-MAX-HEAP(A,A[i]) be the same as BUILD- MAX-HEAP(A) 4-can we modify the Heapsort to run in a time less than O(nlgn)? why?
Expert Solution
steps

Step by step

Solved in 3 steps

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
  • SEE MORE 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