This question keeps getting asked again and again, on mailing lists, and forums, and programming contests.
What’s different for the BCS crowd, is that this question gets asked by “Alumni” to show of their mediocre skills. What’s more wierd is that most “Alumni” that I know of have always demonstrated suboptimal solutions to this problem (refer to definition of “Alumni” below).
For the benefit of the small band of rebels that I’m trying to encourage to purge the empire, here are the hidden plans that destroy the empire. The FFT method would out-run absolutely any method on earth when you’re talking about integer multiplications to the scale of 1000! or above.
All feedback/comments will be appreciated.
The code and a descripton will be found here: http://www.geocities.com/archisgore/code_samples/fft_mult.html
