Advertisement

Acta Informatica

, Volume 6, Issue 4, pp 357–359 | Cite as

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.

Keywords

Information System Operating System Data Structure Communication Network Information Theory 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

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