New Algorithm for Listing All Permutations | Zendy

Haslinda Ibrahim | Zendy; Zurni Omar | Zendy; Azizah Mohd Rohni | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

New Algorithm for Listing All Permutations

Author(s) -

Haslinda Ibrahim,

Zurni Omar,

Azizah Mohd Rohni

Publication year - 2010

Publication title -

modern applied science

Language(s) - English

Resource type - Journals

eISSN - 1913-1852

pISSN - 1913-1844

DOI - 10.5539/mas.v4n2p89

Subject(s) - permutation (music) , listing (finance) , set (abstract data type) , computer science , algorithm , simplicity , task (project management) , carry (investment) , starter , order (exchange) , combinatorics , mathematics , physics , programming language , engineering , systems engineering , finance , quantum mechanics , acoustics , economics , automotive engineering

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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research