Binary search promises O(log n). One wrong decision gives you O(∞). Here is the rule that separates them.
Engineering Notes Algorithms C++
Blog
Technical Logs & System Insights
How I rebuilt my developer workflow for 2026, focusing on Lua-based configuration, LSP performance, and dotfile ergonomics.
Workflow Neovim Lua Dotfiles