Continuing on from your implementation of the PriorityQueue class, add the method create_heap_fast (self, values) which takes a Python list as a parameter. This method should put elements from the Python list into the priority queue without using the insert method. The Big-O of this method is O(n). The method should do the following: • Insert each element from the parameter list and append it to the binary heap. • Set the size to the number of elements in the parameter list. • Get the starting index position (i.e. last element which has a child, size // 2). Rearrange the elements starting from the above index position by calling the percolate_down () method. • Keep rearranging and working backwards towards the root. ● Note: submit the entire class definition. You can assume that the parameter list is not empty. For example: Test pq = PriorityQueue () keys = [9, 5, 8, 6, 3, 2] pq.create_heap_fast(keys) print (pq) Result [0, 2, 3, 8, 6, 5, 9]
Continuing on from your implementation of the PriorityQueue class, add the method create_heap_fast (self, values) which takes a Python list as a parameter. This method should put elements from the Python list into the priority queue without using the insert method. The Big-O of this method is O(n). The method should do the following: • Insert each element from the parameter list and append it to the binary heap. • Set the size to the number of elements in the parameter list. • Get the starting index position (i.e. last element which has a child, size // 2). Rearrange the elements starting from the above index position by calling the percolate_down () method. • Keep rearranging and working backwards towards the root. ● Note: submit the entire class definition. You can assume that the parameter list is not empty. For example: Test pq = PriorityQueue () keys = [9, 5, 8, 6, 3, 2] pq.create_heap_fast(keys) print (pq) Result [0, 2, 3, 8, 6, 5, 9]
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
Related questions
Question
![Continuing on from your implementation of the PriorityQueue class, add the method create_heap_fast (self,
values) which takes a Python list as a parameter. This method should put elements from the Python list into the
priority queue without using the insert method. The Big-O of this method is O(n). The method should do the following:
• Insert each element from the parameter list and append it to the binary heap.
• Set the size to the number of elements in the parameter list.
• Get the starting index position (i.e. last element which has a child, size // 2).
• Rearrange the elements starting from the above index position by calling the percolate_down() method.
• Keep rearranging and working backwards towards the root.
Note: submit the entire class definition. You can assume that the parameter list is not empty.
For example:
Test
pq PriorityQueue ()
keys
[9, 5, 8, 6, 3, 2]
pq.create_heap_fast(keys)
=
=
print (pq)
Result
[0, 2, 3, 8, 6, 5, 9]](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Ff2c3f5f7-6d6e-4e11-94f0-a1343504cdfb%2Fd0637461-8344-4d5d-ae97-07cb3d1e8211%2F74y6t7_processed.png&w=3840&q=75)
Transcribed Image Text:Continuing on from your implementation of the PriorityQueue class, add the method create_heap_fast (self,
values) which takes a Python list as a parameter. This method should put elements from the Python list into the
priority queue without using the insert method. The Big-O of this method is O(n). The method should do the following:
• Insert each element from the parameter list and append it to the binary heap.
• Set the size to the number of elements in the parameter list.
• Get the starting index position (i.e. last element which has a child, size // 2).
• Rearrange the elements starting from the above index position by calling the percolate_down() method.
• Keep rearranging and working backwards towards the root.
Note: submit the entire class definition. You can assume that the parameter list is not empty.
For example:
Test
pq PriorityQueue ()
keys
[9, 5, 8, 6, 3, 2]
pq.create_heap_fast(keys)
=
=
print (pq)
Result
[0, 2, 3, 8, 6, 5, 9]
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 4 steps with 4 images
Knowledge Booster
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.Recommended textbooks for you
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)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
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)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education