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 propos...
| Main Authors: | , , |
|---|---|
| Format: | Conference or Workshop Item |
| Published: |
2013
|
| Subjects: |
| _version_ | 1803627268985061376 |
|---|---|
| author | Karim, Sharmila Ibrahim, Haslinda Omar, Zurni |
| author_facet | Karim, Sharmila Ibrahim, Haslinda Omar, Zurni |
| author_sort | Karim, Sharmila |
| collection | UUM |
| description | 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. |
| first_indexed | 2024-07-04T06:03:22Z |
| format | Conference or Workshop Item |
| id | uum-16854 |
| institution | Universiti Utara Malaysia |
| last_indexed | 2024-07-04T06:03:22Z |
| publishDate | 2013 |
| record_format | dspace |
| spelling | uum-168542016-01-07T04:45:23Z https://repo.uum.edu.my/id/eprint/16854/ Comparison between starter sets generation method for listing all permutations Karim, Sharmila Ibrahim, Haslinda Omar, Zurni QA Mathematics 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. 2013 Conference or Workshop Item PeerReviewed Karim, Sharmila and Ibrahim, Haslinda and Omar, Zurni (2013) Comparison between starter sets generation method for listing all permutations. In: 20th Research in Mathematical Sciences: A Catalyst for Creativity and Innovation, 18–20 December 2012, Palm Garden Hotel, Putrajaya, Malaysia. http://doi.org/10.1063/1.4801219 doi:10.1063/1.4801219 doi:10.1063/1.4801219 |
| spellingShingle | QA Mathematics Karim, Sharmila Ibrahim, Haslinda Omar, Zurni Comparison between starter sets generation method for listing all permutations |
| title | Comparison between starter sets generation method for listing all permutations |
| title_full | Comparison between starter sets generation method for listing all permutations |
| title_fullStr | Comparison between starter sets generation method for listing all permutations |
| title_full_unstemmed | Comparison between starter sets generation method for listing all permutations |
| title_short | Comparison between starter sets generation method for listing all permutations |
| title_sort | comparison between starter sets generation method for listing all permutations |
| topic | QA Mathematics |
| work_keys_str_mv | AT karimsharmila comparisonbetweenstartersetsgenerationmethodforlistingallpermutations AT ibrahimhaslinda comparisonbetweenstartersetsgenerationmethodforlistingallpermutations AT omarzurni comparisonbetweenstartersetsgenerationmethodforlistingallpermutations |