Cover Image

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

Full description

Saved in:
Bibliographic Details
Main Authors: Karim, Sharmila, Omar, Zurni, Ibrahim, Haslinda, Othman, Khairil Iskandar, Suleiman, Mohamed
Format: Article
Language:English
Published: Universiti Putra Malaysia Press 2014
Subjects:
QA Mathematics
Online Access:http://repo.uum.edu.my/16837/1/03.pdf
http://repo.uum.edu.my/16837/
http://www.pertanika.upm.edu.my/regular_issues.php?jtype=2&journal=JST-22-1-1
Tags: Add Tag
No Tags, Be the first to tag this record!
id my.uum.repo.16837
record_format eprints
spelling my.uum.repo.168372016-05-19T01:45:46Z http://repo.uum.edu.my/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 http://repo.uum.edu.my/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
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
Karim, Sharmila
Omar, Zurni
Ibrahim, Haslinda
Othman, Khairil Iskandar
Suleiman, Mohamed
New recursive circular algorithm for listing all permutations
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.
format Article
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
title New recursive circular algorithm for listing all permutations
title_short 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_sort new recursive circular algorithm for listing all permutations
publisher Universiti Putra Malaysia Press
publishDate 2014
url http://repo.uum.edu.my/16837/1/03.pdf
http://repo.uum.edu.my/16837/
http://www.pertanika.upm.edu.my/regular_issues.php?jtype=2&journal=JST-22-1-1
_version_ 1644282072590712832
score 13.211869

Similar Items