rseq: Rising Sequences
In shuffleCI: Confidence Intervals Compared via Shuffling
Description
Usage
Arguments
Details
Value
Author(s)
References
Examples
Description
Determines the number of rising sequences in a list of numbers.
Usage
1
rseq(x)
Arguments
x
List of numbers
Details
A rising sequence is maximal consecutively increasing subsequence.
Ex: 1,4,2,5,6,3,7
There are 3 rising sequences in this list.
(1,4,5,6,7),(2,3)
Value
nrise - the number of rising sequences.
Author(s)
Kyle Caudle
References
Mann, B. (1995). How many times should you shuffle a deck of cards. Topics in Contemporary Probability and Its Applications, 15, 1-33.
Williams, C. O. (1912). A card reading. The Magician Monthly, 8, 67.
Examples
1
shuffleCI documentation built on May 2, 2019, 5:11 a.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 Details Value Author(s) References Examples
Description
Determines the number of rising sequences in a list of numbers.
Usage
1 | rseq(x)
|
Arguments
x |
List of numbers |
Details
A rising sequence is maximal consecutively increasing subsequence.
Ex: 1,4,2,5,6,3,7 There are 3 rising sequences in this list.
(1,4,5,6,7),(2,3)
Value
nrise - the number of rising sequences.
Author(s)
Kyle Caudle
References
Mann, B. (1995). How many times should you shuffle a deck of cards. Topics in Contemporary Probability and Its Applications, 15, 1-33.
Williams, C. O. (1912). A card reading. The Magician Monthly, 8, 67.
Examples
1 |
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.