java - Removing duplicates Quickperm -
I have recently studied the Quickperm algorithm to generate the permutation of a string, and in addition to the other, Is not explanatory. I did not find any other sources which explained it clearly. Apart from this I only examined it and thought that whether we are equal values or not, they will handle the cases when there will be duplicate letters in the string, even then duplicate permutations still arise.
Can anyone explain how to remove duplicate and provide some other sources or explain the quick epigorithm?
Use standard algorithms. Quicker, like many clever algorithms, are weak; It can not be easily normalized in the case where there are duplicates.
Comments
Post a Comment