3 ms·
The Schönhage–Strassen algorithm is a commonly used fast multiplication algorithm that has complexity O(N log N log log N), wouldn't a naive factorial function
by Mvandenbergh 15y ago
The Schönhage–Strassen algorithm is a commonly used fast multiplication algorithm that has complexity O(N log N log log N), wouldn't a naive factorial function based on this have complexity O(N^2 log N log log N) ?
- cperciva 15y agoThere's no point using a fast product if you only multiply by one value at once -- fast products are only useful when you multiply two large values.