2 ms·
Classical multiplication is O(nm), not O(n^2) -- big times small is faster than big times big. A naive factorial is O(n^2 (log n)^2).
by cperciva 15y ago
Classical multiplication is O(nm), not O(n^2) -- big times small is faster than big times big. A naive factorial is O(n^2 (log n)^2).
- Mvandenbergh 15y agobig times small is faster than big times big Right you are, my mistake.