How to analyze JavaScript functions with Big O
Welcome back! To review, the previous article explained the basics of asymptotic notation: the upper-bound/worst case, lower-bound/best case, and the tight-bound/average case for how long... »
What is Big O Notation?
In our previous article we looked at the absolute basics: definitions of data structures and algorithms, how to prove our algorithms are sound, and ways... »
How to design an algorithm
If you missed my previous article, I’m going to spend a series of articles providing notes as I audit Steven Skiena’s CSE 373 Analysis of... »
Why hiring is broken and how I'm dealing with it
Programming interviews are a major source of anxiety and angst among the software community. Every few months you see a post on HackerNews saying that... »