SEALiP: A simple and efficient algorithm for listing permutation via starter set method
Algorithm for listing permutations for n elements is an arduous task.This paper attempts to introduce a novel method for generating permutations.The fundamental concept for this method is to seek a starter set to begin with as an initial set to generate all distinct permutations. In order to demons...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Penerbit UTM Press
2013
|
| Subjects: | |
| Online Access: | https://repo.uum.edu.my/id/eprint/16850/1/11.pdf |
| _version_ | 1825803777836318720 |
|---|---|
| author | Ibrahim, Haslinda Zake, Lugean Omar, Zurni Karim, Sharmila |
| author_facet | Ibrahim, Haslinda Zake, Lugean Omar, Zurni Karim, Sharmila |
| author_sort | Ibrahim, Haslinda |
| collection | UUM |
| description | Algorithm for listing permutations for n elements is an arduous task.This paper attempts to introduce a novel method for generating permutations.The
fundamental concept for this method is to seek a starter set to begin with as an initial set to generate all distinct permutations. In order to demonstrate the algorithm, we are keen to list the permutations with the special references for cases of three and four objects.Based on this algorithm, a new method for listing permutations is developed and analyzed.This new permutation method will be compared with the existing lexicographic method.The results
revealed that this new method is more efficient in terms of computation time. |
| first_indexed | 2024-07-04T06:03:21Z |
| format | Article |
| id | uum-16850 |
| institution | Universiti Utara Malaysia |
| language | English |
| last_indexed | 2024-07-04T06:03:21Z |
| publishDate | 2013 |
| publisher | Penerbit UTM Press |
| record_format | eprints |
| spelling | uum-168502016-01-07T04:33:46Z https://repo.uum.edu.my/id/eprint/16850/ SEALiP: A simple and efficient algorithm for listing permutation via starter set method Ibrahim, Haslinda Zake, Lugean Omar, Zurni Karim, Sharmila QA75 Electronic computers. Computer science Algorithm for listing permutations for n elements is an arduous task.This paper attempts to introduce a novel method for generating permutations.The fundamental concept for this method is to seek a starter set to begin with as an initial set to generate all distinct permutations. In order to demonstrate the algorithm, we are keen to list the permutations with the special references for cases of three and four objects.Based on this algorithm, a new method for listing permutations is developed and analyzed.This new permutation method will be compared with the existing lexicographic method.The results revealed that this new method is more efficient in terms of computation time. Penerbit UTM Press 2013 Article PeerReviewed application/pdf en cc4_by https://repo.uum.edu.my/id/eprint/16850/1/11.pdf Ibrahim, Haslinda and Zake, Lugean and Omar, Zurni and Karim, Sharmila (2013) SEALiP: A simple and efficient algorithm for listing permutation via starter set method. Malaysian Journal of Fundamental and Applied Sciences, 9 (4). pp. 191-195. ISSN 2289-5981 http://www.mjfas.utm.my/index.php/mjfas/article/view/108 |
| spellingShingle | QA75 Electronic computers. Computer science Ibrahim, Haslinda Zake, Lugean Omar, Zurni Karim, Sharmila SEALiP: A simple and efficient algorithm for listing permutation via starter set method |
| title | SEALiP: A simple and efficient algorithm for listing permutation via starter set method |
| title_full | SEALiP: A simple and efficient algorithm for listing permutation via starter set method |
| title_fullStr | SEALiP: A simple and efficient algorithm for listing permutation via starter set method |
| title_full_unstemmed | SEALiP: A simple and efficient algorithm for listing permutation via starter set method |
| title_short | SEALiP: A simple and efficient algorithm for listing permutation via starter set method |
| title_sort | sealip a simple and efficient algorithm for listing permutation via starter set method |
| topic | QA75 Electronic computers. Computer science |
| url | https://repo.uum.edu.my/id/eprint/16850/1/11.pdf |
| work_keys_str_mv | AT ibrahimhaslinda sealipasimpleandefficientalgorithmforlistingpermutationviastartersetmethod AT zakelugean sealipasimpleandefficientalgorithmforlistingpermutationviastartersetmethod AT omarzurni sealipasimpleandefficientalgorithmforlistingpermutationviastartersetmethod AT karimsharmila sealipasimpleandefficientalgorithmforlistingpermutationviastartersetmethod |