// random number generator; generates random permutations

#include<iostream.h>
#include <time.h>
#include<stdlib.h>

#define Size 10

template<class T>
bool SSearch(T a[], const T& x, int n)
{// Search the unordered list a[0:n-1] for x.
 // Return true if found; return false otherwise.
   int i;
   for (i = 0; i < n && a[i] != x; i++);
   if (i == n) return false;
   return true;
}

void main(void)
{
    int a[Size], i, tempNext;
    bool found = true;
cout << "if you want longer permutatations, change Size (at top)" << endl;
cout << "the next random number is diffrent from previous ones" << endl;
cout << endl;

    randomize();

    for(i=0; i<Size; i++) a[i] = -1;

    a[0] = random(Size-1);  // first random number; not a repeat

cout << "i = 0 " << " a = " << a[0] << a[1] << a[2] << a[3]
     << a[4] << a[5] << a[6] << a[7] << a[8] << a[9] << endl;

    for(i=1; i<Size; i++)
    {
        while(found)    //tempNext generated earlier
        {
            tempNext = random(Size); // next random number; possible repeat
            found = SSearch(a, tempNext, i);
        }
        found = true;
        a[i] = tempNext;
cout << "i = " << i << "  a = " << a[0] << a[1] << a[2] << a[3]
     << a[4] << a[5] << a[6] << a[7] << a[8] << a[9] << endl;
    }
    getchar();
}