Can someone write a C++ program that implements a priority queue of maximum leng

Question

Can someone write a C++ program that implements a priority queue of maximum length 25. Use priorities ranging from 0 to 10 with the highest priority a 0. Prompt the user for a priority and a job name (a string), and allow the user to enter a -1 priority to quit entering jobs.

This exercise requires that you implement a function to insert a job anywhere in the queue, which must be implemented as a linked list. Do not remove any duplicates; that is, the same job can be entered multiple times with the same or different priorities.

After the user has quit entering priorities and jobs, print out the resulting queue from head to tail.

If you could add comments, explaining whats going on, it would be appreciated!

Explanation / Answer

Hope this will help to you.

Related Questions

Navigate

• Browse (All)
• Browse C
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.