Okay I am trying to understand the Heap's Algorithm from the original research paper published by B.R Heap. The most confusing aspect I found that while Heap says that the example described on the first page takes N=12 ie. example with 12 objects to provide a permutations for them.But yet he says that the 12 objects are the letters A to Q. Now unless I have forgotten my counting totally, A to Q is 17 objects not 12. So am I missing something obvious ?Secondly, can someone please explain the Table 1 given in the bottom of the first page ?Thanks.
Need explanation of Heap's Algorithm
algorithms;permutations