New algorithm for listing all permutations
The most challenging task dealing with permutation is when the element is large. In this paper, a new algorithm for listing down all permutations for n elements is developed based on distinct starter sets. Once the starter sets are obtained,each starter set is then cycled to obtain the first half o...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Canadian Center of Science and Education
2010
|
| Subjects: | |
| Online Access: | https://repo.uum.edu.my/id/eprint/1760/1/Haslinda_Ibrahim.pdf |
| _version_ | 1825739858445860864 |
|---|---|
| author | Ibrahim, Haslinda Omar, Zurni Mohd Rohni, Azizah |
| author_facet | Ibrahim, Haslinda Omar, Zurni Mohd Rohni, Azizah |
| author_sort | Ibrahim, Haslinda |
| collection | UUM |
| description | The most challenging task dealing with permutation is when the element is large. In this paper, a new algorithm for
listing down all permutations for n elements is developed based on distinct starter sets. Once the starter sets are obtained,each starter set is then cycled to obtain the first half of distinct permutations. The complete list of permutations is achieved by reversing the order of the first half of permutation. The new algorithm has advantages over the other methods due to its simplicity and easy to use. |
| first_indexed | 2024-07-04T05:16:49Z |
| format | Article |
| id | uum-1760 |
| institution | Universiti Utara Malaysia |
| language | English |
| last_indexed | 2024-07-04T05:16:49Z |
| publishDate | 2010 |
| publisher | Canadian Center of Science and Education |
| record_format | eprints |
| spelling | uum-17602010-12-08T00:54:37Z https://repo.uum.edu.my/id/eprint/1760/ New algorithm for listing all permutations Ibrahim, Haslinda Omar, Zurni Mohd Rohni, Azizah QA Mathematics The most challenging task dealing with permutation is when the element is large. In this paper, a new algorithm for listing down all permutations for n elements is developed based on distinct starter sets. Once the starter sets are obtained,each starter set is then cycled to obtain the first half of distinct permutations. The complete list of permutations is achieved by reversing the order of the first half of permutation. The new algorithm has advantages over the other methods due to its simplicity and easy to use. Canadian Center of Science and Education 2010-02 Article PeerReviewed application/pdf en https://repo.uum.edu.my/id/eprint/1760/1/Haslinda_Ibrahim.pdf Ibrahim, Haslinda and Omar, Zurni and Mohd Rohni, Azizah (2010) New algorithm for listing all permutations. Modern Applied Science, 4 (2). pp. 89-94. ISSN 1913-1852 http://www.ccsenet.org/journal/index.php/mas/article/view/5095/4261 |
| spellingShingle | QA Mathematics Ibrahim, Haslinda Omar, Zurni Mohd Rohni, Azizah New algorithm for listing all permutations |
| title | New algorithm for listing all permutations |
| title_full | New algorithm for listing all permutations |
| title_fullStr | New algorithm for listing all permutations |
| title_full_unstemmed | New algorithm for listing all permutations |
| title_short | New algorithm for listing all permutations |
| title_sort | new algorithm for listing all permutations |
| topic | QA Mathematics |
| url | https://repo.uum.edu.my/id/eprint/1760/1/Haslinda_Ibrahim.pdf |
| work_keys_str_mv | AT ibrahimhaslinda newalgorithmforlistingallpermutations AT omarzurni newalgorithmforlistingallpermutations AT mohdrohniazizah newalgorithmforlistingallpermutations |