--- title: "time-complexity" description: "All posts tagged with #time-complexity" url: "https://briansunter.com/tags/time-complexity" --- [All tags](/tags) # time-complexity 5 posts. ## [Recurrence Relation and Master's Theorem for Dividing Functions](/recurrence-relation-masters-theorem-dividing) [How to use the Master's Theorem to figure out the time complexity of divide-and-conquer algorithms like merge sort.](/recurrence-relation-masters-theorem-dividing) Jan 5, 2023 [algorithms](/tags/algorithms)[data-structures](/tags/data-structures)[programming](/tags/programming) ## [Recurrence Relation and Master's Theorem for Subtracting Functions](/recurrence-relation-masters-theorem-subtracting) [The math behind figuring out time complexity for recursive algorithms using recurrence relations.](/recurrence-relation-masters-theorem-subtracting) Jan 5, 2023 [algorithms](/tags/algorithms)[data-structures](/tags/data-structures)[programming](/tags/programming) ## [Algorithms and Data Structures](/algorithms) [My notes on algorithms and data structures, from Big O basics to heaps and sorting.](/algorithms) Oct 4, 2022 [algorithms](/tags/algorithms)[data-structures](/tags/data-structures)[programming](/tags/programming) ## [A Posteriori vs A Priori Analysis of Algorithms](/posteriori-vs-a-priori-analysis-of-algorithms) [Two ways to measure algorithm performance: running benchmarks vs. mathematical analysis.](/posteriori-vs-a-priori-analysis-of-algorithms) Aug 22, 2022 [algorithms](/tags/algorithms)[programming](/tags/programming)[time-complexity](/tags/time-complexity) ## [Time Complexity Analysis](/time-complexity) [What Big O notation actually means, how to compare algorithm efficiency, and the difference between O, Theta, and Omega.](/time-complexity) Aug 22, 2022 [algorithms](/tags/algorithms)[data-structures](/tags/data-structures)[programming](/tags/programming)