Comparison between starter sets generation method for listing all permutations.

Listing of all n! distinct permutations is an exhaustive process. Using starter set, the process of listing the permutations becomes easy. However a problem arises when the equivalence starter sets will generate the similar permutation and needed to be discarded. Two new recursive strategies are proposed to generate starter sets without generating equivalence starter sets namely circular and exchange two elements operation. Once the starter sets are obtained, the circular and reverse of circular operation are employed to produce distinct permutation from each starter sets. Computational advantages are presented comparing the results obtained by the new method with two other existing methods. The result indicates that the exchange two elements based strategy is faster than the circular based. Overall all new algorithms are better than existing algorithms in time execution. [ABSTRACT FROM AUTHOR]