Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd Logo
Upload

Welcome to Scribd!

  • 23 views

    Master Theorem: in The Following, Denotes Either Given and in The Case of The Ceiling Function, The Initial Condition

    Uploaded by

    Cái Búa
    The Master Theorem provides upper and lower bounds for recursively defined problems. It states that if a problem satisfies T(n) = aT(n/b) + f(n), where f(n) is O(nk), then T(n) is O(nk) if a < bk, O(nk log n) if a = bk, or O(nlogba) if a > bk. Similarly for lower bounds if f(n) is Ω(nk) and for exact bounds if f(n) is Θ(nk).

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd

    Master Theorem: in The Following, Denotes Either Given and in The Case of The Ceiling Function, The Initial Condition

    Uploaded by

    Cái Búa
    23 views1 page
    The Master Theorem provides upper and lower bounds for recursively defined problems. It states that if a problem satisfies T(n) = aT(n/b) + f(n), where f(n) is O(nk), then T(n) is O(nk) if a < bk, O(nk log n) if a = bk, or O(nlogba) if a > bk. Similarly for lower bounds if f(n) is Ω(nk) and for exact bounds if f(n) is Θ(nk).

    Original Title

    MT

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The Master Theorem provides upper and lower bounds for recursively defined problems. It states that if a problem satisfies T(n) = aT(n/b) + f(n), where f(n) is O(nk), then T(n) is O(nk) if a < bk, O(nk log n) if a = bk, or O(nlogba) if a > bk. Similarly for lower bounds if f(n) is Ω(nk) and for exact bounds if f(n) is Θ(nk).

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    23 views1 page

    Master Theorem: in The Following, Denotes Either Given and in The Case of The Ceiling Function, The Initial Condition

    Uploaded by

    Cái Búa
    The Master Theorem provides upper and lower bounds for recursively defined problems. It states that if a problem satisfies T(n) = aT(n/b) + f(n), where f(n) is O(nk), then T(n) is O(nk) if a < bk, O(nk log n) if a = bk, or O(nlogba) if a > bk. Similarly for lower bounds if f(n) is Ω(nk) and for exact bounds if f(n) is Θ(nk).

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 1

    Master Theorem

    Theorem 0.1 (Master Theorem) Let a, b, and k be integers satisfying a 1, b 2, and k 0.1 In the following, n denotes either n or n . In the case of the oor function, the initial condition T (0) = u is b b b given; and in the case of the ceiling function, the initial condition T (1) = u is given.

    Upper Bound: If T (n) aT (n/b) + f (n) and f (n) = O(nk ), then O(nk ) O(nk log n) T (n) = O(nlogb a ) if a < bk , if a = bk , if a > bk .

    Lower Bound: If T (n) aT (n/b) + f (n) and f (n) = (nk ), then (nk ) (nk log n) T (n) = (nlogb a ) if a < bk , if a = bk , if a > bk .

    Exact: If T (n) = aT (n/b) + f (n) and f (n) = (nk ), then (nk ) (nk log n) T (n) = (nlogb a ) if a < bk , if a = bk , if a > bk .

    1 More general version of this theorem are known. For example, the theorem is correct if a and b are any real numbers satisfying a 1 and b > 1.

    You might also like