I need a C++ program to implement a heap based priority queue which accepts job ID, priority number and submitter name as inputs. the program should heap sort whenever a new job ID or priority or submitter name is entered. The jobs that have maximum priority should be extracted (along with the job ID, priority number and submitter name) and inserted into ready queue. Can anyone pl help? Its urgent
psmb
0
Newbie Poster
Recommended Answers
Jump to PostThere are plenty of freely available priority queue implementations. What is that they do not provide for you?
All 2 Replies
L7Sqr
227
Practically a Master Poster
mike_2000_17
2,669
21st Century Viking
Team Colleague
Featured Poster
Be a part of the DaniWeb community
We're a friendly, industry-focused community of developers, IT pros, digital marketers, and technology enthusiasts meeting, networking, learning, and sharing knowledge.