On Sun, 13 Jun 2021, Sven Schreiber wrote:
Am 13.06.2021 um 12:45 schrieb Riccardo (Jack) Lucchetti:
> On Sun, 13 Jun 2021, Artur T. wrote:
>
> to add in the documentation that the recursive algorithm I used is not
> the fastest when arguments are large.
Would it be very difficult to add the faster algorithm?
I suspect it would be. I see that the doc for matlab's nchoosek
says, "C = nchoosek(v,k) is only practical for situations where
length(v) is less than about 15." That suggests that they're using
recursion, in which case I guess the practical limitation may be
exhaustion of stack space.
Allin