Acta Informatica

, Volume 6, Issue 4, pp 357–359

On a gauntlet thrown by David Gries

  • Edsger W. Dijkstra
Article

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1976

Authors and Affiliations

  • Edsger W. Dijkstra
    • 1
  1. 1.BurroughsNuenenThe Netherlands

Personalised recommendations