for each element in the array
    generate a random number
    search the array to see if the number already exists
    if not, then add it to the array
    otherwise, if it was found then go back and generate another number
end of loop

const int maxnums= 10;
int nums[maxnums] = {0};
int curnum = 0;
for(int i = 0; i < maxnums; ++i)
{
    bool found = false;
    do {
       int  x = rand();
       for(int j = 0; j < curnum && found == false; ++j)
       {
            if( nums[j] == x)
            {
                found = true;
            }
         }
        if(found == false)
       {
            nums[curnum++] = x;
       }
    } while(found == true);
}

#include <iostream>
#include <algorithm>
#include <ctime>
using namespace std;
 
int main()
{
 
    const int maxnum = 10;
    int nums[maxnum] = {0};
    srand((unsigned int)time(0));
    int curnum = 0;
    for(int i = 0; i < maxnum; ++i)
    {
        bool found = false;
        do
        {
            int x = rand() % 50;
            int* result = std::find(&nums[0], &nums[maxnum-1], x);
            if( *result < 0)
            {
                nums[curnum++] = x;
                found = true;
            }
        } while( found == false);
   }
    for(int i = 0; i < maxnum; ++i)
        cout << nums[i] << "\n";
 
}