From ef94b35d88740c622dc28a75bbb4a6c46617824c Mon Sep 17 00:00:00 2001 From: "Steven G. Johnson" Date: Mon, 5 May 2014 16:43:53 -0400 Subject: [PATCH] mention Bernoulli sampling in randsubseq docs --- doc/stdlib/base.rst | 3 ++- 1 file changed, 2 insertions(+), 1 deletion(-) diff --git a/doc/stdlib/base.rst b/doc/stdlib/base.rst index e0e327fb896c8..df70638fb2a2b 100644 --- a/doc/stdlib/base.rst +++ b/doc/stdlib/base.rst @@ -3819,7 +3819,8 @@ Indexing, Assignment, and Concatenation Return a vector consisting of a random subsequence of the given array ``A``, where each element of ``A`` is included (in order) with independent probability ``p``. (Complexity is linear in ``p*length(A)``, so this - function is efficient even if ``p`` is small and ``A`` is large.) + function is efficient even if ``p`` is small and ``A`` is large.) Technically, + this process is known as "Bernoulli sampling" of ``A``. .. function:: randsubseq!(S, A, p)