Scribd Logo
Upload

Welcome to Scribd!

  • Master Theorem 08nov

    Uploaded by

    akousis
    59 views4 pages
    1. The Master Theorem provides a method for solving recurrence relations of the form T(n) = aT(n/b) + f(n) where a ≥ 1 and b > 1, and f(n) is an asymptotically positive term. 2. The theorem states that there are three cases for the asymptotic solution based on comparing f(n) to nlogba: 1) If f(n) = O(nlogba-ε) for some ε > 0, then T(n) = Θ(nlogba) 2) If f(n) = Θ(nlogba), then T(n) = Θ(nlog

    Original Description:

    Analysis for Master Theorem in Greek

    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
    1. The Master Theorem provides a method for solving recurrence relations of the form T(n) = aT(n/b) + f(n) where a ≥ 1 and b > 1, and f(n) is an asymptotically positive term. 2. The theorem states that there are three cases for the asymptotic solution based on comparing f(n) to nlogba: 1) If f(n) = O(nlogba-ε) for some ε > 0, then T(n) = Θ(nlogba) 2) If f(n) = Θ(nlogba), then T(n) = Θ(nlog

    Copyright:

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

    Master Theorem 08nov

    Uploaded by

    akousis
    1. The Master Theorem provides a method for solving recurrence relations of the form T(n) = aT(n/b) + f(n) where a ≥ 1 and b > 1, and f(n) is an asymptotically positive term. 2. The theorem states that there are three cases for the asymptotic solution based on comparing f(n) to nlogba: 1) If f(n) = O(nlogba-ε) for some ε > 0, then T(n) = Θ(nlogba) 2) If f(n) = Θ(nlogba), then T(n) = Θ(nlog

    Copyright:

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

    {

    2008

    1
    , , (The Master Theorem),

    T (n) = aT (n=b) + f (n);

    a 1 b > 1 f (n) .

    n a n=b,
    T (n=b),

    f (n). :

    1.1 a 1 b > 1 , f (n)


    T (n)

    T (n) = aT (n=b) + f (n):

    T (n) :
    1. f (n) = O(nlogb a )  > 0, T (n) = (nlogb a ).
    2. f (n) = (nlogb a ), T (n) = (nlogb a log n).
    3. f (n) = (nlogb a+ )  > 0, a f (n=b) c f (n)
    c < 1 n , T (n) = (f (n)).

    . .
    f (n) nlogb a
    .
    : ,
    . , (1) f (n) nlogb a
    ( n ,  > 0),
    T (n) = (nlogb a ). (2)
    1

    T (n) = (nlogb a log n). , (3),


    f (n) nlogb a ( n ,
     > 0), a f (n=b) c f (n),

    . , T (n) =
    (f (n)).

    2 .
    :
    1. T (n) = 9T (n=3) + n.
    a = 9; b = 3; f (n) = n, nlog3 9 = n2 f (n) = O(n2 ); 
    (..  = 0:2). (1) .
    T (n) = (n2 ) .
    2. T (n) = T (2n=3) + 1.
    a = 1; b = 3=2; f (n) = 1, nlog3=2 1 = n0 = 1 f (n) = (1):
    (2) . T (n) = (log n).
    3. T (n) = 3T (n=4) + n log n.
    a = 3; b = 4; f (n) = n log n, nlog4 3 = n0:793 f (n) = (n0:793+ );
     (..  = 0:2). , af (n=b) = 3(n=4) log(n=4) =
    3
    n log(n=4) 34 n log n = cf (n); c = 43 ; n.
    4
    (3) . T (n) = (n log n).
    4. T (n) = 4T (n=2) + n.
    a = 4; b = 2; f (n) = n, nlog2 4 = n2 f (n) = O(n2 ); 
    (..  = 0:2). (1) .
    T (n) = (n2 ) .
    5. T (n) = 3T (n=2) + n.
    a = 3; b = 2; f (n) = n, nlog2 3 = n1:59 f (n) = O(n1:59 ); 
    (..  = 0:2). (1) .
    T (n) = (n1:59 ) .
    6. T (n) = 4T (n=2) + n2 .
    a = 4; b = 2; f (n) = n2 , nlog2 4 = n2 f (n) = (n2 ).
    (2) . T (n) = (n2 log n) .
    2

    7. T (n) = 4T (n=2) + n3 .
    a = 4; b = 2; f (n) = n3 , nlog2 4 = n2 f (n) = (n2+ ); 
    (..  = 0:2). , af (n=b) = 4(n=2)3 = 21 n3 = cf (n);
    c = 21 ; n. (3)
    . T (n) = (n3 ).
    8. T (n) = T (n 1) + n.
    H T (n) = T (n1)+n, T (n) = aT (n=b)+f (n),
    . ,
    , .
    9. T (n) = 2T (n=2) + n log n.
    a = 2; b = 2; f (n) = n log n, nlog2 2 = n f (n) = (n), nflog(nb)a =
    n log n
    log2 2
    .
    n = log n f (n) n
    . ,
    , .
    10. T (n) = 8T (n=2) + n.
    a = 8; b = 2; f (n) = n, nlog2 8 = n3 f (n) = O(n3 ); 
    (..  = 0:2). (1) .
    T (n) = (n3 ) .
    11. T (n) = 9T (n=3) + n2 .
    a = 9; b = 3; f (n) = n2 , nlog3 9 = n2 f (n) = (n2 ).
    (2) . T (n) = (n2 log n) .
    12. T (n) = 2T (n=3) + n=2.
    a = 2; b = 3; f (n) = n=2, nlog3 2 = n0:631 f (n) = (n0:631+ ); 
    (..  = 0:2). , af (n=b) = 2 n=2 3 = 23 n=2 = cf (n);
    c = 32 ; n. (3)
    . T (n) = (n=2) = (n).
    13. T (n) = T (n=2) + 1.
    a = 1; b = 2; f (n) = 1, nlog2 1 = n0 = 1 f (n) = (1).
    (2) . T (n) = (log n) .
    14. T (n) = T (n=2) + (1).
    a = 1; b = 2; f (n) = c, c , nlog2 1 = n0 = 1 f (n) = (1):
    (2) . T (n) = (log n).
    3

    15. T (n) = 2T (n=2) + 1.


    T (n) = (n). . (1 ).
    16. T (n) = T (n=2) + n.
    a = 1; b = 2; f (n) = n, nlog2 1 = n0 = 1 f (n) = (n ), 
    (..  = 0:2). , af (n=b) = n2 = 12 n = cf (n); c 12 ;
    n. (3) .
    T (n) = (n) .
    17. T (n) = 2T (n=2) + n:
    T (n) = (n log n). . (2 ).
    18. T (n) = T (n=3) + T (2n=3) + n.
    H T (n) = T (n=3) + T (2n=3) + n, T (n) =
    aT (n=b)+ f (n), .
    , ,
    . ,

    2T (n=3) + n T (n=3) + T (2n=3) + n 2T (2n=3) + n

    (n) 1 (n) (n) 2 (n) 1 (n)


    1 (n) = 2T1 (n=3) + n 2 (n)
    2 (n) = 2T2 (2n=3) + n.
    1 (n) = 2T1 (n=3) + n, a = 2; b = 3; f (n) = n,
    nlog3 2 = n0:631 f (n) = (n0:631+ );  (..  = 0:2).
    , af (n=b) = 2(n=3) = 23 n = cf (n); c = 32 ;
    n. (3) . T1 (n) = (n).
    2 (n) = 2T2 (2n=3) + n, a = 2; b = 3=2; f (n) = n,
    nlog3=2 2 = n0:631 f (n) = (n0:631+ );  (..  =
    0:2). , af (n=b) = 2(n=3) = 32 n = cf (n); c = 32 ;
    n. (3) . T2 (n) = (n).
    1 (n) (n) 2 (n), T1 (n) = (n) T2 (n) = (n).
    T (n) = (n).

    You might also like