Reversing is Not Inherent in Lexicographical Permutation Generation | Zendy

J. S. Rohl | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Reversing is Not Inherent in Lexicographical Permutation Generation

Author(s) -

J. S. Rohl

Publication year - 1990

Publication title -

the computer journal

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.319

H-Index - 64

eISSN - 1460-2067

pISSN - 0010-4620

DOI - 10.1093/comjnl/33.3.274

Subject(s) - reversing , lexicographical order , permutation (music) , flexibility (engineering) , computer science , algorithm , mathematics , combinatorics , statistics , physics , acoustics , materials science , composite material

In his comprehensive 1977 survey of permutation generation methods, Sedgewick [4] stated that ``(reversing) seems to be inherent in lexicographical (permutation) generation''''. It is the purpose of this paper to give an algorithm which does not use reversing and to show its relationship to the classical reversing algorithm of Ord-Smith [3]. We also give a number of related algorithms to illustrate the flexibility of the new algorithm.

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