2 ms·
You 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 c
by scott_s 15y ago
You 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.