Member Avatar for lotrsimp12345
lotrsimp12345 37 Posting Pro in Training

we are supposed to implement using STL vector and base it on priority and have have a data value

So every time i enqueue i insert an in item into the end of the vector and if no space i modify. So do i reorder the list to place the maximum at front when i do this or do I create a find min function?

When i dequeue i would remove from fronso i would have to reorder the priority so minimum is at front?

  • 1 Contributor
  • 0 Replies
  • 65 Views
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.