C++ Abstract Priority Queue Template Class Implementation
Budget: $30 – $250 AUD
I need help completing the 'PriorityQueue.h' file for a C++ task. You will define an abstract priority queue template class for an array of pairs.
Requirements:
The implementation requires two data types: SortablePair, an auxiliary data type for representing sortable pairs, and PriorityQueue, the data type for realizing a priority queue.
I have completed the 'SortablePair.h' file. Only 'PriorityQueue.h' needs to be completed.
The solution code in these files will run against tests in a provided main.cpp file. The code output must match the output in an image provided.
I will send you all the necessary files, including a full set of instructions.
Ideal Skills and Experience:
- Proficiency in C++
- Experience with template classes and data structures
Requirements:
The implementation requires two data types: SortablePair, an auxiliary data type for representing sortable pairs, and PriorityQueue, the data type for realizing a priority queue.
I have completed the 'SortablePair.h' file. Only 'PriorityQueue.h' needs to be completed.
The solution code in these files will run against tests in a provided main.cpp file. The code output must match the output in an image provided.
I will send you all the necessary files, including a full set of instructions.
Ideal Skills and Experience:
- Proficiency in C++
- Experience with template classes and data structures