Cover Image

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

Full description

Saved in:
Bibliographic Details
Main Authors: Karim, Sharmila, Ibrahim, Haslinda, Omar, Zurni
Format: Conference or Workshop Item
Published: 2013
Subjects:
QA Mathematics
Online Access:http://repo.uum.edu.my/16854/
http://doi.org/10.1063/1.4801219
Tags: Add Tag
No Tags, Be the first to tag this record!
id my.uum.repo.16854
record_format eprints
spelling my.uum.repo.168542016-01-07T04:45:23Z http://repo.uum.edu.my/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
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/
topic QA Mathematics
spellingShingle QA Mathematics
Karim, Sharmila
Ibrahim, Haslinda
Omar, Zurni
Comparison between starter sets generation method for listing all permutations
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.
format Conference or Workshop Item
author Karim, Sharmila
Ibrahim, Haslinda
Omar, Zurni
author_facet Karim, Sharmila
Ibrahim, Haslinda
Omar, Zurni
author_sort Karim, Sharmila
title Comparison between starter sets generation method for listing all permutations
title_short 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_sort comparison between starter sets generation method for listing all permutations
publishDate 2013
url http://repo.uum.edu.my/16854/
http://doi.org/10.1063/1.4801219
_version_ 1644282077563060224
score 13.250439

Similar Items