Download link: 36C-3 priority queue Solved
Description
5/5 – (1 vote)
Overview & Learning Objectives
In this program you will implement a priority queue with an underlying binary
heap implementation. There are multiple objectives of this assignment:
-
strengthen your knowledge of JSON,
-
strengthen your understanding of automated testing,
-
understand and implement a binary heap,
-
introduce greedy algorithms using a toy application (Volleyball team se-
lection).
This program consists of three parts:
- creating a priority queue with an underlying binary heap implementation
(you will complete the files priorityqueue.cpp and priorityqueue.h),
- build a binary heap given a sequence of instructions (you will complete
the file buildheap.cxx),
- use your priority queue to construct a greedy algorithm to pick “fair” 2-
person teams from a list of Volleyball players.
