MCODE: Fastest way to multiply

[Albert Chan]

(04-15-2019 03:58 PM)PeterP Wrote:  I found this article on Quanta Magazine (my favorite guilty pleasure read).

Thanks for the link ! Many other nice articles

Too bad the article never touch any details about the fastest method, except O(n log(n))

If anyone want to see real code for other mentioned method, I have some code examples.
Note: MAPM number does based-100, and based-10000 for FFT calculations.

Grade school method: mapm_mul.c
Karatsuba’s method : mapm_fmul.c
Fast Fourier Transform: mapm_fft.c