Adding Nested Loops Makes this Algorithm 120x FASTER?

In the last video, I introduced the concepts of compute-bounded and memory-bounded tasks. This video takes a step further and uses the theory we discussed to optimize a famous memory-bounded algorithm.

Many of these tricks are counterintuitive but highly effective. By the end of the video, you'll find we can make the algorithm around 120x faster than the naive implementation.

Join the Discord server:   / discord  
My GitHub profile: https://github.com/fangjunzhou
The source code used in this video: https://github.com/fangjunzhou/blas-p...
Motion Canvas official repository: https://github.com/motion-canvas/moti...
My custom fork of Motion Canvas: https://github.com/fangjunzhou/motion...