|
|||||
|
|
On a gauntlet thrown by David Gries |
|
| Authors: | Prof Dr Edsger W Dijkstra |
| Affiliation: | (1) Burroughs, Plataanstraat 5, 4565 Nuenen, The Netherlands |
| Abstract: | Summary 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. |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ | |