Vlad's Roam Garden

Powered by 🌱Roam Garden

When you do this properly - you transform linear search into something akin to B-tree search.

Referenced in

functions should be small

From the computational perspective this harmonizes with the idea of executing the tree search on the code you're reading. As it moves code in a direction that would minimize the amount of linear search we are required to perform at any given node.