This is the authors' abstract. We don't add key points for this paper.
The main purpose of Part 2 is to present explicitly the six fastest general permutation algorithms in an improved and standardised form. A comparison shows the kind of difficulties which can arise in the implementation of a high level language. An appendix contains an extended bibliography. A brief account of continuing work is included.
Answers are grounded in this paper and cite their sources.
No takes yet. Share an insight, caveat, or question.
R. J. Ord-Smith (1971) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: