Hello, I am struggling with this question in my class (school). I would really appreciate if anyone helped me. I will upvote! In my problem, I would need to create a class called FinalPQ. This class is going to be a standard priority QUEUE ADT that would be using an array of 10 elements. I am also should be assuming that this priority queue will not be full. After this is declared, the object will require a data type and a comparator. Functions of FinalPQ be: insert(e), removeMin(), isEmpty(), size(), and min(). Essentially, the functions would be similar to PriorityQueue. IMPORTANT: Please test your program with this test case: // Create a FinalPQ object with int as entries and Greater as the comparator (largest value has the highest priority) // You will need to set up Greater as a comparator. // Insert 5. // Insert 9. // Insert 4. // Insert 7. // Output min(). (The result should be 9.) // removeMin() // Output min(). (The result should be 7.) // Insert 2. // Output size(). (The result should be 4.)
Hello, I am struggling with this question in my class (school). I would really appreciate if anyone helped me. I will upvote!
In my problem, I would need to create a class called FinalPQ. This class is going to be a standard priority QUEUE ADT that would be using an array of 10 elements. I am also should be assuming that this priority queue will not be full. After this is declared, the object will require a data type and a comparator.
Functions of FinalPQ be:
insert(e), removeMin(), isEmpty(), size(), and min(). Essentially, the functions would be similar to PriorityQueue.
IMPORTANT:
Please test your program with this test case:
// Create a FinalPQ object with int as entries and Greater as the comparator (largest value has the highest priority) // You will need to set up Greater as a comparator.
// Insert 5.
// Insert 9.
// Insert 4.
// Insert 7.
// Output min(). (The result should be 9.)
// removeMin()
// Output min(). (The result should be 7.)
// Insert 2.
// Output size(). (The result should be 4.)
C++ C++ C+++C +++++
Step by step
Solved in 3 steps with 4 images
