Note that this is an upper bound on the possible number of permutations. For the derivation of these expressions see [here](#derivation:-number-of-permutation).
This potential space is for large $`n`$ neigh impossible to iterate through. As a result we use the 1-factor algorithm as the default. Using randomization, see [TODO:usage](Usage), we can cover a part of this space, however, common pseudo-random number generators have periods on this magnitude and are thus unsuitable for statistical analysis of the possible permutation space.
This potential space is for large $`n`$ neigh impossible to iterate through. As a result we use the 1-factor algorithm as the default. Using randomization, see [Usage](Usage), we can cover a part of this space, however, common pseudo-random number generators have periods on this magnitude and are thus unsuitable for statistical analysis of the possible permutation space.
## Bisection Testing
Aside from the 1-factor algorithm LinkTest also offers other options to define the communication pattern. One of these is to do a bisection test.
