On Thu, Dec 30, 2010 at 6:05 PM, Viktor Cerovski <[email protected]> wrote: > and of course implements only a fraction of J. A week ago I noticed > to my surprise that calculation of factorials runs very fast with bigints, > like considerably faster than in J. For instance:
In addition to lack of fft mechanics: as I understand it, J bigint arithmetic was optimized for speed of formatting, at the expense of manipulation speed. -- Raul ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
