Am 26.12.2011 um 22:18 schrieb Martin Helm: > Am 26.12.2011 21:48, schrieb Dr. Alexander Klein: >> So, if anyone's interested, drop me a note! Alex > I would be interested if you post that.
Hi,
here it is! It now takes 61.6s on my laptop to compute 10000!
There are probably still better - and faster - ways to do this, but it was
primarily meant as an example for multiplication of arbitrarily large integers.
If any of the package maintainers think that this fits in one of the packages,
feel free to add it.
Have fun,
Alex
--
Dr. Alexander Klein, Diplom-Mathematiker
Physiologisches Institut | TransMIT Zentrum
Raum 543 | für Numerische Methoden
Aulweg 129 | Heinrich-Buff-Ring 44
35392 Giessen | 35392 Giessen
big_factorial.m
Description: Binary data
------------------------------------------------------------------------------ Write once. Port to many. Get the SDK and tools to simplify cross-platform app development. Create new or port existing apps to sell to consumers worldwide. Explore the Intel AppUpSM program developer opportunity. appdeveloper.intel.com/join http://p.sf.net/sfu/intel-appdev
_______________________________________________ Octave-dev mailing list Octave-dev@lists.sourceforge.net https://lists.sourceforge.net/lists/listinfo/octave-dev
