#include <iostream>
#include <cstdlib>
#include <ctime>
#include <cstring>
#include <string>
#include <algorithm>
#include <iterator>

int main()
{
    // the hard, inefficient way
    {
        enum { N = 7, M = 13 } ;
        char dest[N][M] = { "zero", "one", "two", "three", "four", "five", "six" } ;

        std::srand( std::time(nullptr) ) ;

        for( int i = N-1 ; i > 0 ; --i ) // fisher yates shuffle
        {
            const int pos = std::rand() % (i+1) ;
            char temp[M] ;
            std::strcpy( temp, dest[pos] ) ;
            std::strcpy( dest[pos], dest[i] ) ;
            std::strcpy( dest[i], temp ) ;
        }

        for( const char* cstr : dest ) std::cout << cstr << ' ' ;
        std::cout << '\n' ;
    }

    // the simple, efficient way
    {
        enum { N = 7 } ;
        std::string dest[N] = { "zero", "one", "two", "three", "four", "five", "six" } ;

        std::srand( std::time(nullptr) ) ; // if it has not already been done

        std::random_shuffle( std::begin(dest), std::end(dest) ) ;

        for( const std::string& str : dest ) std::cout << str << ' ' ;
        std::cout << '\n' ;
    }
}