From: jasonp AT Glue DOT umd DOT edu (Jason Stratos Papadopoulos)
Newsgroups: comp.os.msdos.djgpp
Subject: Re: need help handling enormous size arrays
Date: 6 Feb 1997 07:06:22 GMT
Organization: University of Maryland, College Park
Lines: 18
Message-ID: <5dbvte$hq2@hecate.umd.edu>
References: <5d916e$c1e AT hecate DOT umd DOT edu> <32f90055 DOT 22691415 AT news DOT ox DOT ac DOT uk>
NNTP-Posting-Host: y.glue.umd.edu
To: djgpp AT delorie DOT com
DJ-Gateway: from newsgroup comp.os.msdos.djgpp

George Foot (mert0407 AT sable DOT ox DOT ac DOT uk) wrote:

: If it's not too long, please post your source code - enough to work
: and demonstrate the problem, but not more than is necessary. If you
: are missing something, it won't be obvious to anyone if you don't give
: it to us :)

: George Foot

Oh, do I feel sheepish! The problems came from a bug in the code and are
fixed now. Still, anyone who wants a relatively efficient C function
to multiply enormous numbers together is welcome to it. 

Sorry for the trouble.
jasonp

PS: How *do* you make an FFT that's cache friendly? It could probably
help me a lot.