mahonians_recursive: Compute the Mahonian numbers recursively (very slow for n >...
In corybrunson/tautable: Tables of critical values for Kendall's tau-a
Description
Usage
Arguments
Value
Examples
View source: R/mahonians-recursive.R
Description
Compute the Mahonian numbers recursively (very slow for n > 8).
Usage
1
Arguments
n
A positive integer.
Value
The number of permutations of n having k inversions, as k
ranges from 0 to n.
Examples
1
2
corybrunson/tautable documentation built on March 29, 2021, 9:22 p.m.
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
Description Usage Arguments Value Examples
View source: R/mahonians-recursive.R
Description
Compute the Mahonian numbers recursively (very slow for n > 8).
Usage
1 |
Arguments
n |
A positive integer. |
Value
The number of permutations of n having k inversions, as k
ranges from 0 to n.
Examples
1 2 |
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
Embedding an R snippet on your website
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.