Acta Informatica

, Volume 6, Issue 4, pp 357–359

On a gauntlet thrown by David Gries

Authors

  • Edsger W. Dijkstra
    • Burroughs
Article

DOI: 10.1007/BF00268136

Cite this article as:
Dijkstra, E.W. Acta Informatica (1976) 6: 357. doi:10.1007/BF00268136

Summary

It is requested to design a program that will generate the N! permutations of the values from 0 through N1 in such an order that the transition from one permutation to the next is always performed by exactly one swap of two neighbours.

Download to read the full article text

Copyright information

© Springer-Verlag 1976