Scribd Logo
Upload

Welcome to Scribd!

  • Materi 4a Master Theorem

    Uploaded by

    Satria Abimayu
    12 views7 pages
    The document discusses the master theorem, which provides a general form for solving recurrence relations. It describes that the master theorem looks at the size of the problem n, the number of subproblems a, the size of each subproblem n/b, and the cost of work done outside recursive calls f(n). It then outlines three cases for how to solve recurrence relations using the master theorem depending on the asymptotic growth rates of f(n) compared to n.

    Original Description:

    y

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document discusses the master theorem, which provides a general form for solving recurrence relations. It describes that the master theorem looks at the size of the problem n, the number of subproblems a, the size of each subproblem n/b, and the cost of work done outside recursive calls f(n). It then outlines three cases for how to solve recurrence relations using the master theorem depending on the asymptotic growth rates of f(n) compared to n.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    12 views7 pages

    Materi 4a Master Theorem

    Uploaded by

    Satria Abimayu
    The document discusses the master theorem, which provides a general form for solving recurrence relations. It describes that the master theorem looks at the size of the problem n, the number of subproblems a, the size of each subproblem n/b, and the cost of work done outside recursive calls f(n). It then outlines three cases for how to solve recurrence relations using the master theorem depending on the asymptotic growth rates of f(n) compared to n.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 7

    Master Theorem

    Master Theorem
    • Bentuk umum master theorem yang berhubungan dengan
    recurrence relations :

    • n is the size of the problem.


    • a is the number of subproblems in the recursion.
    • n/b is the size of each subproblem. (Here it is assumed that all
    subproblems are essentially the same size.)
    • f (n) is the cost of the work done outside the recursive calls,
    which includes the cost of dividing the problem and the cost of
    merging the solutions to the subproblems.
    Kasus 1
    Kasus 2
    Kasus 3
    Persamaan yang tidak dapat dipecahkan dengan
    The master theorem

    You might also like