Merge Sort: Divide, Conquer, and Rebuild Order
A methodical deep dive into Merge Sort—how divide-and-conquer beats quadratic time, why merging is where correctness lives, and how O(n log n) changes what is possible at scale.
Articles, tutorials, and insights on software engineering, computer science, algorithms, and engineering practices
Showing page 3 of 12
A methodical deep dive into Merge Sort—how divide-and-conquer beats quadratic time, why merging is where correctness lives, and how O(n log n) changes what is possible at scale.
In-depth Engineering Log review of You Don't Know JS: this & Object Prototypes by Kyle Simpson: what it covers, who it helps, and what makes it worth reading...
A practical guide to the four metrics that explain why your API feels slow, plus a tiny demo API implemented across popular stacks with real measurement queries.
A practical exploration of Selection Sort—how it works, why its invariant matters, when it performs well, and how it compares to Bubble Sort and Insertion Sort. Includes pseudocode, diagrams, benchmarks, and implementations across major languages.
Long-form review of Beyond Cracking the Coding Interview: new algorithm topics, 150+ problems, job-search tactics, negotiation, and behavioral prep.
Long-form review of Steve McConnell’s Code Complete (2nd ed.): construction checklists, evidence-based practice, and who should invest the page count.