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. Jan 5, 2023 algorithms data-structures programming
Recurrence Relation and Master's Theorem for Subtracting Functions The math behind figuring out time complexity for recursive algorithms using recurrence relations. Jan 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. Oct 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. Aug 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. Aug 22, 2022 algorithms data-structures programming
