2 ms·
Ok, agreed about matrix multiplication and probably a few other problems, disagreeing about cache. You cannot really say that cache-aware algorithms have highe
by praptak 15y ago
Ok, agreed about matrix multiplication and probably a few other problems, disagreeing about cache.
You cannot really say that cache-aware algorithms have higher asymptotic bound. Some of them might happen to have below-optimal asymptotic bound in a cache-unaware memory model, which sort of misses the point of the algorithms being aware of cache.
- scott_s 15y agoYou cannot really say that cache-aware algorithms have higher asymptotic bound. Don't worry, I'm not. I'm saying that sometimes, naive algorithms have better cache behavior than more complicated algorithms with lower asymptotic bounds.