Some combinatoric algorithms in APL

Abstract

The problems of enumerating permutations, combinations and partitions and of constructing algorithms for their orderly generation have been widely discussed in the last few years. Some of the routines so far published in Fortran-type languages make the underlying algorithms appear more complicated than they really are. This paper summarlses some established methods and shows how APL leads to natural and concise means both of exposition and of algorithm construction.