Looping through a list infinitely

Hello and Happy New Year,

I would like to loop through a list of names infinitely like this:

Harry
Dick
Tom
===
Dick
Tom
Harry
===
Tom
Dick
Harry

etc...

I have this for the moment:

Code:

---

#include <iostream>
using namespace std;

int main()
{
    int i = 0, j = 0;

    char * Names[] =
    {
        "Harry ", "Dick", "Tom",
    };

    int iSize = (sizeof(Names)/sizeof(Names[0]));

    while(1)
    {
        for(; i<=iSize; i++)
        {

            if(j >= iSize) j = 0;
            cout << Names[j++] << endl;
        }
        cout << endl;

        if(j == iSize) j = 1;
    }

    return 0;
}

---

You mean a permutation -> Permutation - Wikipedia

Also, you posted this C++ program on the C board.

If it really is C++, use this.
std::next_permutation - cppreference.com

Thank you, yes, its permutation what I was looking for, with permutation it is much simple.

I managed to do it with for loop after all.

Code:

---

#include <windows.h>
#include <iostream>
using namespace std;

int main()
{
    int j = 0, iCounter = 0;

    char * Names[] =
    {
        "Harry ", "Dick", "Tom",
    };

    int iSize = (sizeof(Names)/sizeof(Names[0]));
   

    int global = iSize+3;

    while(global--) // just for test purpose, to avoid going on forever
    {
        for(int i=0; i<iSize; i++)
        {

            if(j == iSize) j = 0;
            cout << Names[j++] << endl;

        }
        cout << " = = = " << endl;

        if(iCounter == (iSize-1))
        {
            j = 0;
            iCounter = -1;
        }
        else if((iCounter < iSize))
        {
            j = iCounter + 1;
        }

        iCounter++;
    }

    return 0;
}

---

No, finally its not permutation what I was looking for.

This is permutation:
abc
acb
bac
bca
cab
cba

And I was looking for this:
abc
bca
cab

How about

Code:

---

#include <iostream>
using namespace std;

int main()
{
    int j = 0, iCounter = 0;

    const char * Names[] =
    {
        "Harry ", "Dick", "Tom",
    };

    int iSize = (sizeof(Names)/sizeof(Names[0]));

    for ( int start = 0 ; start < iSize ; start++ ) {
        for ( int count = 0 ; count < iSize ; count++ ) {
            int index = (start + count) % iSize;
            cout << Names[index] << endl;
        }
        cout << "===" << endl;
    }

    return 0;
}

---

Yes, that's a simpler solution than mine.

With only the modulus operator you replaced half of my code :)

Thank you Salem.