A permutation generation method

Fike, C. T.

doi:10.1093/comjnl/18.1.21

Search citation statements

Order By: Relevance

Paper Sections

Select...

Assists1

Other Types Of Algorithms1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

1976

2014

Publication Types

Select...

Article4

Book2

Relationship

Self Cite0

Independent6

Authors

Journals

Cited by 9 publications

(2 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Indeed there is evidence (Fike 1975), (Rohl 1976) that a recursive procedure can be the more efficient.…”

Section: Assistsmentioning

confidence: 99%

Why recursion?

Rohl

1980

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…Indeed there is evidence (Fike 1975), (Rohl 1976) that a recursive procedure can be the more efficient.…”

Section: Assistsmentioning

confidence: 99%

Why recursion?

Rohl

1980

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…We can easily apply the same idea to exchange methods like Algorithm 1. A procedure like this was given by C. T. Fike [13], who also gave a nonrecursive version [37] which is similar to a program developed independently by S. Pleszczyfiski [35]. These programs are clearly less efficient than the methods of Section 1, which have the same control structure but require many fewer exchanges.…”

Section: Other Types Of Algorithmsmentioning

confidence: 99%

Permutation Generation Methods

1977

View full text Add to dashboard Cite

This paper surveys the numerous methods that have been proposed for permutatmn enumeration by computer. The various algorithms which have been developed over the years are described in detail, and zmplemented in a modern ALc, oL-hke language. All of the algorithms are derived from one rumple control structure.The problems involved with implementing the best of the algorithms on real computers are treated m detail. Assembly-language programs are derived and analyzed fully.The paper is intended not only as a survey of permutation generation methods, but also as a tutomal on how to compare a number of different algorithms for the same task

show abstract