New Algorithm for Listing All Permutations

Haslinda Ibrahim, Zurni Omar, Azizah Mohd. Rohni


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.

Full Text:



Copyright (c)

Modern Applied Science   ISSN 1913-1844 (Print)   ISSN 1913-1852 (Online)  Email:

Copyright © Canadian Center of Science and Education

To make sure that you can receive messages from us, please add the '' domain to your e-mail 'safe list'. If you do not receive e-mail in your 'inbox', check your 'bulk mail' or 'junk mail' folders.