Recurrence Relation and Master's Theorem for Dividing Functions
How to use the Master's Theorem to figure out the time complexity of divide-and-conquer algorithms like merge sort.
January 5, 2023
algorithms data-structures programming
Time-complexity
5 posts
Recurrence Relation and Master's Theorem for Subtracting Functions
The math behind figuring out time complexity for recursive algorithms using recurrence relations.
January 5, 2023
algorithms data-structures programming
Algorithms and Data Structures
My notes on algorithms and data structures, from Big O basics to heaps and sorting.
October 4, 2022
algorithms data-structures programming
A Posteriori vs A Priori Analysis of Algorithms
Two ways to measure algorithm performance: running benchmarks vs. mathematical analysis.
August 22, 2022
algorithms programming time-complexity
Time Complexity Analysis
What Big O notation actually means, how to compare algorithm efficiency, and the difference between O, Theta, and Omega.
August 22, 2022
algorithms data-structures programming