Skip to main content
SpringerLink
Log in

On a gauntlet thrown by David Gries

  • Published:
Acta Informatica Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Burroughs, Plataanstraat 5, 4565, Nuenen, The Netherlands

    Edsger W. Dijkstra

Authors
  1. Edsger W. Dijkstra
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Dijkstra, E.W. On a gauntlet thrown by David Gries. Acta Informatica 6, 357–359 (1976). https://doi.org/10.1007/BF00268136

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00268136

Keywords

Search

Navigation