Heap's algorithm
Template:Short description Template:Distinguish
Heap's algorithm generates all possible permutations of Template:Math objects. It was first proposed by B. R. Heap in 1963.[1] The algorithm minimizes movement: it generates each permutation from the previous one by interchanging a single pair of elements; the other Template:Math elements are not disturbed. In a 1977 review of permutation-generating algorithms, Robert Sedgewick concluded that it was at that time the most effective algorithm for generating permutations by computer.[2]
The sequence of permutations of Template:Math objects generated by Heap's algorithm is the beginning of the sequence of permutations of Template:Math objects. So there is one infinite sequence of permutations generated by Heap's algorithm Template:OEIS.
Details of the algorithm
For a collection containing Template:Math different elements, Heap found a systematic method for choosing at each step a pair of elements to switch in order to produce every possible permutation of these elements exactly once.
Described recursively as a decrease and conquer method, Heap's algorithm operates at each step on the initial elements of the collection. Initially and thereafter . Each step generates the permutations that end with the same final elements. It does this by calling itself once with the element unaltered and then times with the () element exchanged for each of the initial elements. The recursive calls modify the initial elements and a rule is needed at each iteration to select which will be exchanged with the last. Heap's method says that this choice can be made by the parity of the number of elements operated on at this step. If is even, then the final element is iteratively exchanged with each element index. If is odd, the final element is always exchanged with the first.
// Output the k! permutations of A in which the first k elements are permuted in all ways.
// To get all permutations of A, use k := length of A.
//
// If, k > length of A, will try to access A out of bounds.
// If k <= 0 there will be no output (empty array has no permutations)
procedure permutations(k : integer, A : array of any):
if k = 1 then
output(A)
else
// permutations with last element fixed
permutations(k - 1, A)
// permutations with last element swapped out
for i := 0; i < k-1; i += 1 do
if k is even then
swap(A[i], A[k-1])
else
swap(A[0], A[k-1])
end if
permutations(k - 1, A)
end for
end if
One can also write the algorithm in a non-recursive format.[3]
procedure permutations(n : integer, A : array of any):
// c is an encoding of the stack state.
// c[k] encodes the for-loop counter for when permutations(k - 1, A) is called
c : array of int
for i := 0; i < n; i += 1 do
c[i] := 0
end for
output(A)
// i acts similarly to a stack pointer
i := 1;
while i < n do
if c[i] < i then
if i is even then
swap(A[0], A[i])
else
swap(A[c[i]], A[i])
end if
output(A)
// Swap has occurred ending the while-loop. Simulate the increment of the while-loop counter
c[i] += 1
// Simulate recursive call reaching the base case by bringing the pointer to the base case analog in the array
i := 1
else
// Calling permutations(i+1, A) has ended as the while-loop terminated. Reset the state and simulate popping the stack by incrementing the pointer.
c[i] := 0
i += 1
end if
end while
Proof
In this proof, we'll use the below implementation as Heap's algorithm as it makes the analysis easier, and certain patterns can be easily illustrated. While it is not optimal (it does not minimize moves, which is described in the section below), the implementation is correct and will produce all permutations.
// Output the k! permutations of A in which the first k elements are permuted in all ways.
// To get all permutations of A, use k := length of A.
//
// If, k > length of A, will try to access A out of bounds.
// If k <= 0 there will be no output (empty array has no permutations)
procedure permutations(k : integer, A : array of any):
if k = 1 then
output(A)
else
for i := 0; i < k; i += 1 do
permutations(k - 1, A)
if k is even then
swap(A[i], A[k-1])
else
swap(A[0], A[k-1])
end if
end for
end if
Claim: If array A has length Template:Mvar, then permutations(n, A) will result in either A being unchanged, if Template:Mvar is odd, or, if Template:Mvar is even, then A is rotated to the right by 1 (last element shifted in front of other elements).
Base: If array Template:Mvar has length 1, then permutations(1, A) will output A and stop, so A is unchanged. Since 1 is odd, this is what was claimed, so the claim is true for arrays of length 1.
Induction: If the claim is true for arrays of length Template:Math ≥ 1, then we show that the claim is true for arrays of length Template:Math+1 (together with the base case this proves that the claim is true for arrays of all lengths). Since the claim depends on whether Template:Math is odd or even, we prove each case separately.
If Template:Math is odd, then, by the induction hypothesis, for an array A of length Template:Math, permutations(l, A) will not change A, and for the claim to hold for arrays of length Template:Math+1 (which is even), we need to show that permutations(l+1, A) rotates A to the right by 1 position. Doing permutations(l+1, A) will first do permutations(l, A) (leaving A unchanged since Template:Math is odd) and then in each iteration Template:Math of the for-loop, swap the elements in positions Template:Math and Template:Math (the last position) in A. The first swap puts element Template:Math (the last element) in position 0, and element 0 in position Template:Math. The next swap puts the element in position Template:Math (where the previous iteration put original element 0) in position 1 and element 1 in position Template:Math. In the final iteration, the swap puts element Template:Math-1 is in position Template:Math, and the element in position Template:Math (where the previous iteration put original element Template:Math-2) in position Template:Math-1. To illustrate the above, look below for the case Template:Math = 4.
1,2,3,4 ... original array 1,2,3,4 ... 1st iteration (permute subarray) 4,2,3,1 ... 1st iteration (swap 1st element into last position) 4,2,3,1 ... 2nd iteration (permute subarray) 4,1,3,2 ... 2nd iteration (swap 2nd element into last position) 4,1,3,2 ... 3rd iteration (permute subarray) 4,1,2,3 ... 3rd iteration (swap 3rd element into last position) 4,1,2,3 ... 4th iteration (permute subarray) 4,1,2,3 ... 4th iteration (swap 4th element into last position) The altered array is a rotated version of the original
If Template:Math is even, then, by the induction hypothesis, for an array A of length Template:Math, permutations(l, A) rotates A to the right by 1 position, and for the claim to hold for arrays of length Template:Math+1 (which is odd), we need to show that permutations(l+1, A) leaves A unchanged. Doing permutations(l+1, A) will in each iteration Template:Math of the for-loop, first do permutations(l, A) (rotating the first Template:Math elements of A by 1 position since Template:Math is even) and then, swap the elements in positions 0 and Template:Math (the last position) in A. Rotating the first Template:Math elements and then swapping the first and last elements is equivalent to rotating the entire array. Since there are as many iterations of the loop as there are elements in the array, the entire array is rotated until each element returns to where it started. To illustrate the above, look below for the case Template:Math = 5.
1,2,3,4,5 ... original array 4,1,2,3,5 ... 1st iteration (permute subarray, which rotates it) 5,1,2,3,4 ... 1st iteration (swap) 3,5,1,2,4 ... 2nd iteration (permute subarray, which rotates it) 4,5,1,2,3 ... 2nd iteration (swap) 2,4,5,1,3 ... 3rd iteration (permute subarray, which rotates it) 3,4,5,1,2 ... 3rd iteration (swap) 1,3,4,5,2 ... 4th iteration (permute subarray, which rotates it) 2,3,4,5,1 ... 4th iteration (swap) 5,2,3,4,1 ... 5th iteration (permute subarray, which rotates it) 1,2,3,4,5 ... 5th iteration (swap) The final state of the array is in the same order as the original
The induction proof for the claim is now complete, which will now lead to why Heap's Algorithm creates all permutations of array Template:Mvar. Once again we will prove by induction the correctness of Heap's Algorithm.
Basis: Heap's Algorithm trivially permutes an array Template:Mvar of size Template:Mvar as outputting Template:Mvar is the one and only permutation of Template:Mvar.
Induction: Assume Heap's Algorithm permutes an array of size Template:Mvar. Using the results from the previous proof, every element of Template:Mvar will be in the "buffer" once when the first Template:Mvar elements are permuted. Because permutations of an array can be made by altering some array Template:Mvar through the removal of an element Template:Mvar from Template:Mvar then tacking on Template:Mvar to each permutation of the altered array, it follows that Heap's Algorithm permutes an array of size , for the "buffer" in essence holds the removed element, being tacked onto the permutations of the subarray of size Template:Mvar. Because each iteration of Heap's Algorithm has a different element of Template:Mvar occupying the buffer when the subarray is permuted, every permutation is generated as each element of Template:Mvar has a chance to be tacked onto the permutations of the array Template:Mvar without the buffer element.
Frequent mis-implementations
It is tempting to simplify the recursive version given above by reducing the instances of recursive calls. For example, as:
procedure permutations(k : integer, A : array of any):
if k = 1 then
output(A)
else
// Recursively call once for each k
for i := 0; i < k; i += 1 do
permutations(k - 1, A)
// swap choice dependent on parity of k (even or odd)
if k is even then
// no-op when i == k-1
swap(A[i], A[k-1])
else
// XXX incorrect additional swap when i==k-1
swap(A[0], A[k-1])
end if
end for
end if
This implementation will succeed in producing all permutations but does not minimize movement. As the recursive call-stacks unwind, it results in additional swaps at each level. Half of these will be no-ops of and where but when is odd, it results in additional swaps of the with the element.
| swaps | additional = swaps | ||
|---|---|---|---|
| 1 | 0 | 0 | 0 |
| 2 | 1 | 1 | 0 |
| 3 | 5 | 6 | 1 |
| 4 | 23 | 27 | 4 |
| 5 | 119 | 140 | 21 |
| 6 | 719 | 845 | 126 |
| 7 | 5039 | 5922 | 883 |
| 8 | 40319 | 47383 | 7064 |
| 9 | 362879 | 426456 | 63577 |
These additional swaps significantly alter the order of the prefix elements.
The additional swaps can be avoided by either adding an additional recursive call before the loop and looping times (as above) or looping times and checking that is less than as in:
procedure permutations(k : integer, A : array of any):
if k = 1 then
output(A)
else
// Recursively call once for each k
for i := 0; i < k; i += 1 do
permutations(k - 1, A)
// avoid swap when i==k-1
if (i < k - 1)
// swap choice dependent on parity of k
if k is even then
swap(A[i], A[k-1])
else
swap(A[0], A[k-1])
end if
end if
end for
end if
The choice is primarily aesthetic but the latter results in checking the value of twice as often.