MEMORY ACCESS IS O(N^[1/3])

Summary from the TLDR newsletter

If you can break up a task into many parts, each of which is highly local, then memory access in each part will be O(1), but if the task requires a lot of memory interdependencies, then you will get lots of O(N^⅓) terms.