Hi, I need to find distance between two permutations of a string of length N. Distance in this case is defined as the minimum number of swaps needed to convert one permutation into another. Can somebody help me out with it. The expected order of complexity is O(N.log(N)).
Eg: With two permutations as : abcd, cdba . The distance is 3 as min 3 swaps are required to convert one into another. abcd(swap a and c) -> cbad(swap d and b) -> cdab(swap b and a)-> cdba --~--~---------~--~----~------------~-------~--~----~ 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 -~----------~----~----~----~------~----~------~--~---
