Purchase Solution

Move elements in C++ queue using template

Not what you're looking for?

Ask Custom Question

See attached file.

Write a function

template<typename T>
void n2front (queue<T>& q, int n);

that moves the nth element (counting from the front, which is element 1) of the queue to the front, leaving the order of all other elements unchanged. The function throws the rangeError exception if n < 1 or n> q.size(). The figure illustrates the action of n2front() for an integer queue and n = 4.

n = 4 (4th element of queue).

Before
8 5 17 3 7
front back

After
3 8 5 17 7
front back

Please provide a complete program if it makes sense.

Attachments
Purchase this Solution
Solution Summary

The solution puts the elements in a queue, then changes the order of them (see attachment).

Purchase this Solution
Free BrainMass Quizzes
Inserting and deleting in a linked list

This quiz tests your understanding of how to insert and delete elements in a linked list. Understanding of the use of linked lists, and the related performance aspects, is an important fundamental skill of computer science data structures.

C# variables and classes

This quiz contains questions about C# classes and variables.

Word 2010: Tables

Have you never worked with Tables in Word 2010? Maybe it has been a while since you have used a Table in Word and you need to brush up on your skills. Several keywords and popular options are discussed as you go through this quiz.

Basic Computer Terms

We use many basic terms like bit, pixel in our usual conversations about computers. Are we aware of what these mean? This little quiz is an attempt towards discovering that.

Excel Introductory Quiz

This quiz tests your knowledge of basics of MS-Excel.

View More Free Quizzes
Related BrainMass Solutions

  • Reverse a stack

    Write a function template, reverseStack, that takes a parameter a stack object and a queue object whose elements are of the same type. The function reverseStack uses the queue to reverse the elements of the stack.

  • C++ stack in terms of queue and symbol balancing using stack

    214055 C++ Stack in Terms of Queue and Symbol Balancing using Stack 1. Define a stack in terms of the queue i.e. create a class template Class StackQ { Queue pool; .......................

  • definition of the function template

    108777 Queues C++ Write the definition of the function template moveNthFront that takes as a parameter a queue and a positive integer, n. The function moves the nth element of the queue to the front.

  • the definition of the function template

    108779 Queues C++ Add the operation queueCount to the class queueType (the array implementation of queues), which returns the number of elements in the queue. Write the definition of the function template to implement this operation.

  • C++ Queuing Systems for Objects

    Two Three Four Five Question 18 In the STL class queue the ____ function returns the number of elements in the queue.

  • C++: Delete largest value from the list (priority queue)

    269354 C++: Delete largest value from the list (priority queue) Assume that a doubly linked list "header" stores the elements of a priority queue.

  • Data Structures in C++ Using STL

    133924 Data Structures with C++ Using STL List the elements in the queue after each of the following operations: queue intQueue; intQueue.push(18); intQueue.push(2); intQueue.push(intQueue.front()); intQueue.push(intQueue.front()); intQueue.pop

  • Implement Dijkstra in C++

    Using priority queue to implement Dijkstra algorithm to find minimum path in a graph and fill the list of minInfo elements.

  • C++ Functions and Responses

    Which of the following members in the UML diagram keeps track of the number of elements in a queue at a given point in time?

View More Related Solutions