On Sat, Jun 20, 2009 at 12:52 AM, gerrob<robert.gerb...@gmail.com> wrote: > > Hi! > > For factorial routine today I've written a fast solution that is > faster for large n than gmp/mpir's currently code, if n is about 1 > million or larger. > > For n=10^6: my code takes 1.7 sec., gmp's code: 2.3 sec. > For n=10^7: my code takes 27 sec., gmp's code 45 sec. > > For my code see the google group.
I don't understand. I'm looking at the Google Group right now as I read this message, but i don't see your code. I would be interested in including it in Sage (which uses MPIR) if it doesn't turn out to be appropriate to include in MPIR. - William > > > -- William Stein Associate Professor of Mathematics University of Washington http://wstein.org --~--~---------~--~----~------------~-------~--~----~ 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 -~----------~----~----~----~------~----~------~--~---
