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.

Full text not available from this repository. (Request a copy)

Abstract

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.

Item Type:	Conference or Workshop Item (Paper)
Additional Information:	ISBN: 978-0-7354-1150-0
Subjects:	Q Science > QA Mathematics
Divisions:	College of Arts and Sciences
Depositing User:	Dr. Sharmila Karim
Date Deposited:	07 Jan 2016 04:45
Last Modified:	07 Jan 2016 04:45
URI:	https://repo.uum.edu.my/id/eprint/16854

Actions (login required)

View Item