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....
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Universiti Putra Malaysia Press
2014
|
| Subjects: | |
| Online Access: | https://repo.uum.edu.my/id/eprint/16837/1/03.pdf |
| _version_ | 1803627265001521152 |
|---|---|
| author | Karim, Sharmila Omar, Zurni Ibrahim, Haslinda Othman, Khairil Iskandar Suleiman, Mohamed |
| author_facet | Karim, Sharmila Omar, Zurni Ibrahim, Haslinda Othman, Khairil Iskandar Suleiman, Mohamed |
| author_sort | Karim, Sharmila |
| collection | UUM |
| description | 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. |
| first_indexed | 2024-07-04T06:03:18Z |
| format | Article |
| id | uum-16837 |
| institution | Universiti Utara Malaysia |
| language | English |
| last_indexed | 2024-07-04T06:03:18Z |
| publishDate | 2014 |
| publisher | Universiti Putra Malaysia Press |
| record_format | dspace |
| spelling | uum-168372016-05-19T01:45:46Z https://repo.uum.edu.my/id/eprint/16837/ New recursive circular algorithm for listing all permutations Karim, Sharmila Omar, Zurni Ibrahim, Haslinda Othman, Khairil Iskandar Suleiman, Mohamed QA Mathematics 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. Universiti Putra Malaysia Press 2014 Article PeerReviewed application/pdf en https://repo.uum.edu.my/id/eprint/16837/1/03.pdf Karim, Sharmila and Omar, Zurni and Ibrahim, Haslinda and Othman, Khairil Iskandar and Suleiman, Mohamed (2014) New recursive circular algorithm for listing all permutations. Pertanika Journal of Social Sciences & Humanities, 22 (1). pp. 25-33. ISSN 0128-7702 http://www.pertanika.upm.edu.my/regular_issues.php?jtype=2&journal=JST-22-1-1 |
| spellingShingle | QA Mathematics Karim, Sharmila Omar, Zurni Ibrahim, Haslinda Othman, Khairil Iskandar Suleiman, Mohamed New recursive circular algorithm for listing all permutations |
| title | New recursive circular algorithm for listing all permutations |
| title_full | New recursive circular algorithm for listing all permutations |
| title_fullStr | New recursive circular algorithm for listing all permutations |
| title_full_unstemmed | New recursive circular algorithm for listing all permutations |
| title_short | New recursive circular algorithm for listing all permutations |
| title_sort | new recursive circular algorithm for listing all permutations |
| topic | QA Mathematics |
| url | https://repo.uum.edu.my/id/eprint/16837/1/03.pdf |
| work_keys_str_mv | AT karimsharmila newrecursivecircularalgorithmforlistingallpermutations AT omarzurni newrecursivecircularalgorithmforlistingallpermutations AT ibrahimhaslinda newrecursivecircularalgorithmforlistingallpermutations AT othmankhairiliskandar newrecursivecircularalgorithmforlistingallpermutations AT suleimanmohamed newrecursivecircularalgorithmforlistingallpermutations |