mention Bernoulli sampling in randsubseq docs

JuliaLang · May 5, 2014 · ef94b35 · ef94b35
1 parent f6702e2
commit ef94b35
Showing 1 changed file with 2 additions and 1 deletion.
diff --git 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)