Abstract
The main purpose of Part 2 is to present explicitly the six fastest general permutation algorithms in an improved and standardised form. A comparison shows the kind of difficulties which can arise in the implementation of a high level language. An appendix contains an extended bibliography. A brief account of continuing work is included.

This publication has 0 references indexed in Scilit: