Binary Search Algorithm
A walkthrough of binary search with both iterative and recursive implementations, plus why it's O(log n).
January 5, 2023
13 posts
A walkthrough of binary search with both iterative and recursive implementations, plus why it's O(log n).
January 5, 2023
How to use the Master's Theorem to figure out the time complexity of divide-and-conquer algorithms like merge sort.
January 5, 2023
The math behind figuring out time complexity for recursive algorithms using recurrence relations.
January 5, 2023
How heaps work, why they're useful for priority queues, and how to implement heap sort.
January 5, 2023
Common data structures and the problems they solve.
November 26, 2022
My notes on algorithms and data structures, from Big O basics to heaps and sorting.
October 4, 2022
What algorithms are, why they matter, and how to start thinking about problem solving.
October 4, 2022
The classic Gauss formula for summing consecutive integers, and why it matters for algorithm analysis.
October 2, 2022
Integer Sum Formula, Donald Knuth on Email, and Werner Herzog
August 23, 2022
Two ways to measure algorithm performance: running benchmarks vs. mathematical analysis.
August 22, 2022
What Big O notation actually means, how to compare algorithm efficiency, and the difference between O, Theta, and Omega.
August 22, 2022
Launching my new Logseq-powered website, algorithm analysis techniques, the five-minute journal practice, Richard Hamming's advice on doing important research, and the release of Stable Diffusion AI image generation.
August 10, 2022
A structured learning path through data structures and algorithms fundamentals.
July 10, 2022