谁有穷举字符串的算法？aaaaaa-zzzzzz

Question

char aZ = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ"
char tmpBuff[7] = "aaaaaa";
int i,j,k,l,m,n;for(i = 0; i < 52 ; i ++)
{
   tmpBuff[0] = aZ[i];
      for(j=0; j<52; j++)
      {
          tmpBuff[1] = aZ[j];
          for(k=0; k<52; k++)
         {
             tmpBuff[2] = aZ[k];
             for(l=0; l<52; l++)
             {
                tmpBuff[3] = aZ[l];
                for(m=0; m<52; m++)
                {
                   tmpBuff[4] = aZ[m];
                   for(n=0; n<52; n++)
                   {
                      tmpBuff[5] = aZ[n];
                      tmpBuff[6] = 0;
                      printf("%s",tmpBuff);
                   }
                }
             }
         }
      }
   }
}