Function permutohedron::heap_recursive

pub fn heap_recursive<T, F>(xs: &mut [T], f: F) where F: FnMut(&mut [T])

Heap's algorithm for generating permutations, recursive version.

The recursive algorithm supports slices of any size (even though only a small number of elements is practical), and is generally a bit faster than the iterative version.