algorithm for finding permutation of characters

[m sergei]

I am not asking for code but wanted help with understanding the
algorithm to permute all characters of a string.
say string is "ABCD"

I want to know the algorithm for finding all permutations of the given
string, without recursion and with recursion.

[Kai-Uwe Bux]

m sergei wrote:

I am not asking for code but wanted help with understanding the
algorithm to permute all characters of a string.
say string is "ABCD"

I want to know the algorithm for finding all permutations of the given
string, without recursion and with recursion.

There is nothing as "the algorithm" to do this. There is a vast multitude
of different algorithms that have been proposed. D.E. Knuth has a chapter
on this, which you can download:

http://www-cs-faculty.stanford.edu/~knuth/fasc2b.ps.gz

It is about 60 pages.
Best

Kai-Uwe Bux

[David Harmon]

On 28 Jun 2004 19:30:14 -0700 in comp.lang.c++, se********@yaho o.com (m
sergei) wrote,

I am not asking for code but wanted help with understanding the
algorithm to permute all characters of a string.
say string is "ABCD"

By "the algorithm" do you mean std::next_permu tation?

[John Harrison]

"m sergei" <se********@yah oo.com> wrote in message
news:86******** *************** ***@posting.goo gle.com...

I am not asking for code but wanted help with understanding the
algorithm to permute all characters of a string.
say string is "ABCD"

I want to know the algorithm for finding all permutations of the given
string, without recursion and with recursion.

A non-recursive algorithm can be found by looking at the
std::next_permu tation code, which will be in the header file <algorithm>
that comes with your compiler (or possibly in another header file that is
included by <algorithm>, search around you'll find it).

john

[Philip Parker]

one way of doing it with recursion. should do all chars in a,b,c,d,e as so:
a-b, a-c, a-d, a-e
b-c, b-d, b-e
c-d, c-e
d-e

for (int i=0; i<numofchars; i++) {
for (int j=(i+1);j<numof chars;j++) {
// do something with the char at i, and the char at j
}
}

"m sergei" <se********@yah oo.com> wrote in message
news:86******** *************** ***@posting.goo gle.com...

I am not asking for code but wanted help with understanding the
algorithm to permute all characters of a string.
say string is "ABCD"

I want to know the algorithm for finding all permutations of the given
string, without recursion and with recursion.