Queue class algorith/code

Hello people!! I have a queue class that works just fine. But I need to have it spit out permutations of A B C. Like A , B, C, AA, AB, AC, BA, BB, BC, ..... CCC. I haven't the vaguest idea how to even get started on this part. My professor said something like print add add put in rear or something like that...but I didn't really understand.

Here's my client class:

Code:

---

#include <iostream>
#include <string>
#include "queue.h"


int main(void)
{
        Queue myLine; //myLine is a new queue object

        char userans;
        el_t eltoget, eltoadd;

        cout << "Enter your choice Q to quit or something else";
        cin >> userans;
       
        while((userans != 'Q') && (!myLine.isFull()))
        {
                cout << "Give me an element to add: ";
                cin >> eltoadd;
                myLine.add(eltoadd);

                cout << "Enter your choice Q to quit or something else";
                cin >> userans;
        }

        cout << "The Line has " << myLine.getSize() << " elements." << endl;
        cout << "Now removing and displaying all elements..." << endl;
       
        while(!myLine.isEmpty())
        {
                myLine.remove(eltoget);
                cout << eltoget << endl;
        }

        system("pause");
        return 0;
}

---

I'm sure some smart person in here has done this type of thing...if you could just steer me in the right direction I could probably handle it from there....

Thanks for any help!

You'll have to decide whether you're trying to build permutations (as in shuffle), or the list of things that you had listed instead (all the one-, two-, and three-letter words from a three-letter alphabet?).

I believe a permutation algorithm has been posted here on the boards a couple of times at least. On the other hand, it certainly didn't use a queue. I'm sure there's a data structure less useful in this situation than a queue, but I'm not sure what it could be. (Linked lists and stacks seem equally un-useful to me right now.)

It has to be an unuseful list with a queue.

Quote:

---

My professor said [...] I didn't really understand.

---

Quote:

---

myLine.remove(eltoget);

---

Quote:

---

It has to be an unuseful list with a queue.

---

Your professor is a quack.

Algorithms for generating permutations and combinations have nothing to do with the data structures you might use to store permutations and combinations.

Quote:

---

I'm sure there's a data [...] sure what it could be.

---

Trie?

Soma

Quote:

---

Your professor is a quack.

---

This is very true...but I still need to do this stupid assignment. Actually I shouldn't call it stupid since I can't figure it out.