On ápr. 27, 03:22, Bill Hart <goodwillh...@googlemail.com> wrote: > Did you receive any feedback > on the code from them?
As I remember at the same time there were 4 codes from 3 peoples to speed up the computation of binomial coefficients. What hasn't been done is to choose the best one from 5 codes (including original) for different operand sizes. It is always interesting to compare different free/non-free software's speed. Using the latest versions I get the following times for computing binomial(2000000,1000000) my code: 0.5 sec. Pari-Gp: 8 sec. Mathematica: 11 sec. (using gmp, but for this their own code) Sage: 14 sec. (it is using Pari-Gp) Gmp/Mpir: 268 sec. "the fastest bignum library on the planet!" Maple: 1362 sec. (-> what is it doing?!, using gmp) Mathematica is non-free, but it is containing a reference guide, from that "Factorial, Binomial and related functions use a divide-and-conquer algorithm to balance the number of digits in subproducts." This is what I'm doing. --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "mpir-devel" group. To post to this group, send email to mpir-devel@googlegroups.com To unsubscribe from this group, send email to mpir-devel+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/mpir-devel?hl=en -~----------~----~----~----~------~----~------~--~---
