Scribd Logo
Upload

Welcome to Scribd!

  • Asafasdfasfdfsdfasf

    Uploaded by

    Victor Maldonado
    2 views1 page
    The document analyzes the runtime of a recursive function T(n) using the master theorem. It shows that T(n) = 2*T(n/2) + Theta(log(n)) and applies the summation formula to determine the overall runtime is Θ(nlogn). Finally, it applies the master theorem conditions to conclude that T(n) is Θ(n).

    Original Description:

    Original Title

    asafasdfasfdfsdfasf

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document analyzes the runtime of a recursive function T(n) using the master theorem. It shows that T(n) = 2*T(n/2) + Theta(log(n)) and applies the summation formula to determine the overall runtime is Θ(nlogn). Finally, it applies the master theorem conditions to conclude that T(n) is Θ(n).

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    2 views1 page

    Asafasdfasfdfsdfasf

    Uploaded by

    Victor Maldonado
    The document analyzes the runtime of a recursive function T(n) using the master theorem. It shows that T(n) = 2*T(n/2) + Theta(log(n)) and applies the summation formula to determine the overall runtime is Θ(nlogn). Finally, it applies the master theorem conditions to conclude that T(n) is Θ(n).

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 1

    T(n) = 2*T(n/2) + Theta(log(n)).

    T(n/2^i) = log(n/2^i) = log(n) - log(2^i) = log(n) i


    2*T(n/2) = 2^i * (log(n) - i) = log(n) * 2^i = log(n) * (2^(k + 1) - 2) ~ n*log(n)

    Using master theorem


    T(n) = a T(n/b) + f(n)
    where: a = 2, b = 2 and f(n) = log(n)
    f(n) = O(n^(1 - ))
    then log(n) O(n^(1 - )) with < 1
    T(n) Theta(n)

    You might also like