Abstract
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.
| Original language | English |
|---|---|
| Pages (from-to) | 357-359 |
| Journal | Acta Informatica |
| Volume | 6 |
| Issue number | 4 |
| DOIs | |
| Publication status | Published - 1976 |