http://stackoverflow.com/questions/1900197/generating-variations-without-repetitions-permutations-in-java/
On Wed, Jul 4, 2012 at 8:16 PM, Nishant Pandey <[email protected] > wrote: > 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 <[email protected]>wrote: > >> 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 <[email protected]> wrote: >> > 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 <[email protected]> wrote: >> >> 1) Find all permutations of a string. >> >> 2) Improve it so that the permutations are not repeated, Eg=> string is >> >> "aaaa" >> >> Answer should be just aaaa 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 Google >> Groups >> >> "Algorithm Geeks" group. >> >> To post to this group, send email to [email protected]. >> >> To unsubscribe from this group, send email to >> >> [email protected]. >> >> For more options, visit this group at >> >> http://groups.google.com/group/algogeeks?hl=en. >> >> >> >> >> > >> >> -- >> You received this message because you are subscribed to the Google Groups >> "Algorithm Geeks" group. >> To post to this group, send email to [email protected]. >> To unsubscribe from this group, send email to >> [email protected]. >> For more options, visit this group at >> http://groups.google.com/group/algogeeks?hl=en. >> >> > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to [email protected]. > To unsubscribe from this group, send email to > [email protected]. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- Abhishek Sharma Under-Graduate Student, PEC University of Technology -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
