Simple Search:

New recursive circular algorithm for listing all permutations


Citation

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 Science & Technology, 22 (1). pp. 25-33. ISSN 0128-7680; ESSN: 2231-8526

Abstract / Synopsis

Linear array of permutations is hard to be factorised. 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, willneed 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.


Download File

[img]
Preview
PDF
40. New Recursive Circular Algorithm for Listing All Permutations.pdf

Download (513kB) | Preview

Additional Metadata

Item Type: Article
Divisions: Faculty of Science
Publisher: Universiti Putra Malaysia Press
Keywords: Algorithm; Circular; Permutation; Starter sets
Depositing User: Najah Mohd Ali
Date Deposited: 05 Nov 2015 11:30
Last Modified: 05 Nov 2015 11:30
URI: http://psasir.upm.edu.my/id/eprint/40552
Statistic Details: View Download Statistic

Actions (login required)

View Item View Item