Ibrahim, Haslinda and Omar, Zurni and Mohd Rohni, Azizah (2010) New algorithm for listing all permutations. Modern Applied Science, 4 (2). pp. 89-94. ISSN 1913-1852

PDF Restricted to Repository staff only Download (326kB)

Abstract

The most challenging task dealing with permutation is when the element is large. In this paper, a new algorithm for listing down all permutations for n elements is developed based on distinct starter sets. Once the starter sets are obtained,each starter set is then cycled to obtain the first half of distinct permutations. The complete list of permutations is achieved by reversing the order of the first half of permutation. The new algorithm has advantages over the other methods due to its simplicity and easy to use.

Item Type:	Article
Uncontrolled Keywords:	Permutation, Starter sets, Cycle
Subjects:	Q Science > QA Mathematics
Divisions:	College of Arts and Sciences
Depositing User:	Prof. Dr. Zurni Omar
Date Deposited:	08 Dec 2010 00:54
Last Modified:	08 Dec 2010 00:54
URI:	https://repo.uum.edu.my/id/eprint/1760

Actions (login required)

View Item