Post

✨ Big O ✨ Let me take you on a visual introduction to what big O notation is in my new blog post: samwho.dev/big-o. With big O notation you can better understand how algorithms will perform in practice, finding orders of magnitude improvements often with very simple changes to your code.

This is awesome! I love interactive articles! To add to the inaccuracy/variability of loop timing that you called out, here's a technique that I think helps with discounting the loop overhead: ates.dev/posts/2025-0...

I only call sum once so I don’t think this technique applies. I’m running the code on a pool of web worker threads so there’s a bunch of overhead in posting messages back and forth and then with OS-level thread scheduling.