3 ms·
You're really just exploiting hidden O(?) implementations inside the CPU, so it still applies, just less visibly.
by Andys 2y ago
You're really just exploiting hidden O(?) implementations inside the CPU, so it still applies, just less visibly.
- ryao 2y agoHe is improving the constant factor in big O notation. University algorithm classes tend to ignore cases where the constant factor difference is significant enough to favor a asymptomatically slower algorithm. Matrix multiplication is the quintessential example of this, since a good implementation of the O(n^3) algorithm will outperform asymptotically faster algorithms, such as the famous O(n^2 * log(n) * log(log(n))) one that uses the FFT. At least, it outperforms it on matrix multiplications people actually do in practice.