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

PDF Restricted to Registered users only Download (511kB) | Request a copy

Abstract

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.

Item Type:	Article
Uncontrolled Keywords:	Algorithm, circular, permutation, starter sets
Subjects:	Q Science > QA Mathematics
Divisions:	School of Quantitative Sciences
Depositing User:	Dr. Sharmila Karim
Date Deposited:	07 Jan 2016 03:16
Last Modified:	19 May 2016 01:45
URI:	https://repo.uum.edu.my/id/eprint/16837

Actions (login required)

View Item