jszhn

Recent Notes

  • A* algorithm

    Oct 29, 2025

    • ALOHA

      Oct 29, 2025

      • ARP

        Oct 29, 2025

        • Accounting

          Oct 29, 2025

          • Activation function

            Oct 29, 2025

            Home

            ❯

            Recurrence relation

            Recurrence relation

            Oct 27, 20241 min read

            A recurrence (or recurrence relation) is an equation that describes a function in terms of its value on smaller arguments. There are a few ways of solving recurrences (i.e., finding their asymptotic bounds for O, Ω, Θ):

            • Master theorem
            • Substitution method
            • Recursion tree method
            • Recurrence expansion
            • Akra-Bazzi method

            Graph View

            Backlinks

            • Algorithmic analysis
            • Difference equation
            • Dynamic programming
            • Master theorem
            • Recursion
            • Substitution method
            • Time complexity
            • ECE244 — Programming Fundamentals
            • ECE345 — Algorithms and Data Structures

            Created with Quartz v4.5.2 © 2025

            • Twitter
            • LinkedIn
            • GitHub