3 ms·
For easier reading and referencing you could specify the total big-O cost of your algorithm right in the beginning (or even in the abstract). And an indication
by enriquto 8y ago
For easier reading and referencing you could specify the total big-O cost of your algorithm right in the beginning (or even in the abstract). And an indication on which range of input sizes it is likely to outperform karatsuba multiplication before being outperformed by the fft.