recurse

start

Permutation (integers 1 to <code>length(start)</code> in some order)

perm

Number of times to apply the permutation.  <code>i=0</code> gives
  <code>start</code> by definition

Recursively apply a permutation to a vector an arbitrary number of
times.  Negative times mean apply the inverse permutation.

array

a collection of efficient, vectorized algorithms for the
 creation and investigation of magic squares, including methods for
 creating normal magic squares of any order greater than 2.  The
 ultimate intention is for the package to be a computerized embodiment
 all magic square knowledge, including direct numerical verification
 of properties of magic squares (such as recent results on the
 determinant of odd-ordered semimagic squares).  The package also
 serves as a rebuttal to the often-heard comment "I thought R
 was just for statistics".

recurse: Recursively apply a permutation

Description

Usage

Arguments

See Also

Examples