I need an implementation of radix sort that works for strings in c++.
This is what I am using to generate the string randomly.

#include <iostream>
#include <cstdlib>
#define STRING_SIZE 11
#define ARRAY_SIZE 10

using std::cout;
using std::endl;

void generate(char ppt[][STRING_SIZE])
{
     for (int j=0; j<ARRAY_SIZE;j++)
     {
          for(int i =0; i<STRING_SIZE-1;i++)
          {
                  ppt[j][i] = rand()%2 + 'A';
          }
         ppt[j][STRING_SIZE-1]='\0';
     }
}

void print(char ppt[ARRAY_SIZE][STRING_SIZE])
{
    for(int i=0; i<ARRAY_SIZE; i++)
  		cout << "ppt[" << i << "] = " << ppt[i] << endl;
}


int main()
{
    srand(time(0));
    char array[ARRAY_SIZE][STRING_SIZE];
    generate(array);
    print(array);
    system("pause");
    return 0;
}

The complexity of doing a radix sort on strings is that they have
arbitrary length, and an increase in length goes towards the less
significant digits. The general algorithm is:

RadixSrt(A, d)
for i <- 1 to d
   do use a stable sort to sort array A on digit i

For strings you'd have to remap the "digit" concept to be the char at
the given index. d would have to be the length of the longest string
in the set, and index 1 is the index of the last char in the longest
string, index d is always the 0th char of a string (str[0]). You'd
also have to do a check to verify that you are not accessing an
illegal index (off the end of the string): if you do, you should
assume the value of that char is 0 (since a shorter word should come
before a longer word, ex: "compute" before "computer"). Aside from
these alterations, it should run like any implementation of radix sort
for integers.

I don't have time to work out the exact code right now, but you should
be able to adjust an example that runs on integers based on the above.