Which sorting algorithm to reach for, and when
7 min read A reference for the common sorting algorithms, their time and space costs, whether each is stable, and which one to name when an interview constraint changes. Read article
Algorithms
Algorithms
The real Big-O of list, HashMap, and vector
6 min read What the standard containers in Python, Java, and C++ actually cost per operation, and the ones that quietly turn an O(n) loop into O(n squared). Read article
Algorithms
The Big-O table interviewers expect you to have memorized
7 min read The per-operation cost of every common data structure, the amortized-versus-worst-case traps, and how to state complexity out loud without getting corrected. Read article
Algorithms
How time complexity actually grows when n gets big
5 min read Big-O answers one question, what the running time does when you double the input, and the gap between O(n log n) and O(n squared) at scale is where coding interviews are won or lost. Read article
