📄️ about
My History
📄️ Calc Log Base 2: How Many Binary Search Steps?
A practical mental model for estimating how many steps it takes to reduce a search space using binary search. This method skips log math and instead uses zero-chunking and power-of-two intuition to quickly home in on the answer.
📄️ The Math Hashmap: How Programmers Already Know Advanced Math
A CS-first approach to understanding math symbols by mapping them to programming concepts, including how to reason about return values.