I think this will definitely be suitable for inclusion in MPIR. I haven't fully made up my mind, but I *think* I am going to spend the next two days merging all Robert's contributions. MPIR-1.2.2 will basically be for that purpose, I think.
Bill. 2009/6/20 Robert Gerbicz <robert.gerb...@gmail.com>: > > > 2009/6/20 William Stein <wst...@gmail.com> >> >> 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 >> >> > > Hi ! > > You can use/modify my code. > For the code, see: http://groups.google.com/group/mpir-devel/files > it's name is newfacui.c > > > > --~--~---------~--~----~------------~-------~--~----~ 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 -~----------~----~----~----~------~----~------~--~---
