New recursive circular algorithm for listing all permutations
Linear array of permutations is hard to be factorized.However, by using a starter set, the process of listing the permutations becomes easy. Once the starter sets are obtained, the circular and reverse of circular operations are easily employed to produce distinct permutations from each starter set....
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Universiti Putra Malaysia Press
2014
|
| Subjects: | |
| Online Access: | http://repo.uum.edu.my/16837/1/03.pdf http://repo.uum.edu.my/16837/ http://www.pertanika.upm.edu.my/regular_issues.php?jtype=2&journal=JST-22-1-1 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | Linear array of permutations is hard to be factorized.However, by using a starter set, the process of listing the permutations becomes easy. Once the starter sets are obtained, the circular and reverse of circular operations are easily employed to produce distinct permutations from each starter set.However, a problem arises when the equivalence starter sets generate similar permutations and, therefore, will need
to be discarded. In this paper, a new recursive strategy is proposed to generate starter sets that will not incur equivalence by circular operation. Computational advantages are presented that compare the results obtained by the new algorithm with those obtained using two other existing methods.The result indicates that the new algorithm is faster than the other two in time execution. |
|---|