Both cases are discussed here with proof:
http://www.divye.in/2011/06/printing-all-permutations-of-string.html?m=1
Full Disclosure: I am the author of that post.
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To view this discussion on the
you can use flag[256];
now you just need to check
loop:
flag[str[i]]==0)
{
//swap()
//permute function call
//swap()
flag[str[i]=1;
}
done
On 7/3/12, Nishant Pandey nishant.bits.me...@gmail.com wrote:
1) Find all permutations of a string.
2) Improve it so that
you can use flag[256];
now you just need to check
loop:
if (flag[str[i]]==0)
{
//swap()
//permute function call
//swap()
flag[str[i]=1;
}
done
On 7/4/12, atul anand atul.87fri...@gmail.com wrote:
you can use flag[256];
now you just need to check
loop:
the code works fine only in case of duplicates , but if we consider
string to be non duplicates like say :abc then all permutation cant be
obtainned .
On Wed, Jul 4, 2012 at 12:31 PM, atul anand atul.87fri...@gmail.com wrote:
you can use flag[256];
now you just need to check
loop:
if
http://stackoverflow.com/questions/1900197/generating-variations-without-repetitions-permutations-in-java/
On Wed, Jul 4, 2012 at 8:16 PM, Nishant Pandey nishant.bits.me...@gmail.com
wrote:
the code works fine only in case of duplicates , but if we consider
string to be non duplicates like
1) Find all permutations of a string.
2) Improve it so that the permutations are not repeated, Eg= string is
Answer should be just once not 4! times.
i want suggestion to improve the recursive code in case of 2) case .
--
You received this message because you are subscribed to the
