[andre1011]

Hello everyone, I am looking for an algorithm to find recurcive permutations of a string. Could someone point me

in the right direction? For example I have a link list of strings:

C A T

the number of permutations is 6 (3! = 3x2x1) so the different arrangements of letters would go like this

C A T

A C T

A T C

T A C

T C A

C T A

If I have the algorithm I can do the rest myself. This is what I have tried so far

void permute::permutation(int n)
{
 node *rightNeighbor;
 node *nextRightNeighbor;
 node *previousNeighbor;

 //cout<<" numberOfNodes "<<numberOfNodes<<" n = "<<n<<endl<<endl;
 if( n == numberOfNodes )
 {
   return;
 }
 else
 {
    if(n == 1)
    {
      anchor = firstNode; /* first letter = first node (c) is the anchor */
    }

    rightNeighbor = anchor->Link();
    nextRightNeighbor = rightNeighbor->Link();
    if( nextRightNeighbor != NULL)
    {
      nextRightNeighbor = rightNeighbor->Link();
    }
    else
    {
      nextRightNeighbor = NULL;
    }
 
    previousNeighbor = rightNeighbor;
    anchor->set_link( nextRightNeighbor );
    rightNeighbor->set_link( anchor );
    firstNode = rightNeighbor;
    rightNeighbor = anchor->Link();
	if(rightNeighbor->Link() == NULL)
	{
      nextRightNeighbor = NULL;
	}
    permutation(n + 1);
 }
 printList();

}/* end permutation */

[KYA]

Here's a snippet of mine that does recursive string permutation.

[andre1011]

I understand what you did but I need to do the same thing with a link list of strings

[Skydiver]

If you understand the code snippet, then you should know that the same concepts apply with a linked list. The swapping was easier to do with an array, but the same thing can be done with a linked list.