C / C++ / MFC

led mike wrote:

Use a bucket for every other letter in the alphabet. Then every letter you trip over, pour it into the right bucket.

Michael Hildebrand wrote:

It is more difficult then I thought.

Yusuf.A wrote:

This is classical case of permutations. From your example you seem to follow an order, is that a requirement?

#include <stdio.h>

#define N		6

char x[N];
char r[N+1];
int L;

void step(int k, int l)
{
  if (l==L)
  {	
    printf("%s.\n", r);
    return;
  }
  for (int i=k; i<N; i++)
  {
    r[l] = x[i];
    step(i+1, l+1);
  }
}

void main()
{
  r[L] = '\0';
  for (int i=0; i<N; i++)
  {
    x[i]='A'+i;
  }
  for (L=N; L>1; L--)
  {
    r[L] = '\0';
    step(0,0);
  }	
}

Michael Hildebrand wrote:

I Love you Man!

Michael Hildebrand wrote:

Works!

Michael Hildebrand wrote:

I was studying this for 4 hours!