Cover Image

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...

Full description

Saved in:
Bibliographic Details
Main Authors: Ibrahim, Haslinda, Omar, Zurni, Mohd Rohni, Azizah
Format: Article
Language:English
Published: Canadian Center of Science and Education 2010
Subjects:
QA Mathematics
Online Access:http://repo.uum.edu.my/1760/1/Haslinda_Ibrahim.pdf
http://repo.uum.edu.my/1760/
http://www.ccsenet.org/journal/index.php/mas/article/view/5095/4261
Tags: Add Tag
No Tags, Be the first to tag this record!
id my.uum.repo.1760
record_format eprints
spelling my.uum.repo.17602010-12-08T00:54:37Z http://repo.uum.edu.my/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 http://repo.uum.edu.my/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
institution Universiti Utara Malaysia
building UUM Library
collection Institutional Repository
continent Asia
country Malaysia
content_provider Universiti Utara Malaysia
content_source UUM Institutionali Repository
url_provider http://repo.uum.edu.my/
language English
topic QA Mathematics
spellingShingle QA Mathematics
Ibrahim, Haslinda
Omar, Zurni
Mohd Rohni, Azizah
New algorithm for listing all permutations
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.
format Article
author Ibrahim, Haslinda
Omar, Zurni
Mohd Rohni, Azizah
author_facet Ibrahim, Haslinda
Omar, Zurni
Mohd Rohni, Azizah
author_sort Ibrahim, Haslinda
title New algorithm for listing all permutations
title_short 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_sort new algorithm for listing all permutations
publisher Canadian Center of Science and Education
publishDate 2010
url http://repo.uum.edu.my/1760/1/Haslinda_Ibrahim.pdf
http://repo.uum.edu.my/1760/
http://www.ccsenet.org/journal/index.php/mas/article/view/5095/4261
_version_ 1644278060464209920
score 13.188404

Similar Items