In a recent article Fike describes an elegant new algorithm for generating permutations and gives two procedures implementing this algorithm. In this paper we give improved versions with comparative measurements on two machine/compiler systems. The results show that on one of the systems a recursive procedure is the fastest.
No takes yet. Share an insight, caveat, or question.
J. S. Rohl (1976) studied this question.
Synapse has enriched 3 closely related papers on similar clinical questions. Consider them for comparative context: