Well it would take n! as you have to print all the permutations and you will have to swap positions to find the next permutation from the current permutation and you need to do it in a orderly fashion so that you don't have to keep track of the permutations you have already produced to prevent duplicates.
-Senthil. On Sat, Mar 10, 2012 at 8:27 AM, rahul sharma <[email protected]>wrote: > plz xplain logic and if possible plz post ths algo too...thnx in advance > > -- > 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.
