ABSTRACT
There is a simple way to list all the permutations of an n-element set in lexicographic order.
There is a simple way to list all the k-element combinations of an n-element set in lexicographic order.
In this chapter, we describe algorithms to list permutations and combinations of a set. Such algorithms are useful in a variety of mathematics and computer science applications. We will conclude with a wonderful “minimal change” listing of permutations known as the Johnson-Trotter algorithm.
