On a gauntlet thrown by David Gries
- Cite this article as:
- Dijkstra, E.W. Acta Informatica (1976) 6: 357. doi:10.1007/BF00268136
It is requested to design a program that will generate the N! permutations of the values from 0 through N — 1 in such an order that the transition from one permutation to the next is always performed by exactly one swap of two neighbours.