Scribd Logo
Upload

Welcome to Scribd!

  • 14 views

    Lab 4

    Uploaded by

    Muraru Mihaela
    This document contains solutions to several recurrence relations using the Master's theorem: 1. It solves relations of the form T(n) = aT(n/b) + f(n) and determines the complexity of each using the Master's theorem. 2. It solves two relations of the form T(n) = 2T(n-1) + f(n) using repeated substitution to determine the closed form solution is Θ(2^n) and Θ(2n) respectively. 3. It transforms a relation of the form T(n) = 2T(n/2) + lg(n) into an equivalent relation solvable by the Master's theorem

    Copyright:

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

    You might also like

    Lab 4

    Uploaded by

    Muraru Mihaela
    14 views3 pages
    This document contains solutions to several recurrence relations using the Master's theorem: 1. It solves relations of the form T(n) = aT(n/b) + f(n) and determines the complexity of each using the Master's theorem. 2. It solves two relations of the form T(n) = 2T(n-1) + f(n) using repeated substitution to determine the closed form solution is Θ(2^n) and Θ(2n) respectively. 3. It transforms a relation of the form T(n) = 2T(n/2) + lg(n) into an equivalent relation solvable by the Master's theorem

    Original Description:

    Original Title

    lab4

    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?

    Report this Document
    This document contains solutions to several recurrence relations using the Master's theorem: 1. It solves relations of the form T(n) = aT(n/b) + f(n) and determines the complexity of each using the Master's theorem. 2. It solves two relations of the form T(n) = 2T(n-1) + f(n) using repeated substitution to determine the closed form solution is Θ(2^n) and Θ(2n) respectively. 3. It transforms a relation of the form T(n) = 2T(n/2) + lg(n) into an equivalent relation solvable by the Master's theorem

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    14 views3 pages

    Lab 4

    Uploaded by

    Muraru Mihaela
    This document contains solutions to several recurrence relations using the Master's theorem: 1. It solves relations of the form T(n) = aT(n/b) + f(n) and determines the complexity of each using the Master's theorem. 2. It solves two relations of the form T(n) = 2T(n-1) + f(n) using repeated substitution to determine the closed form solution is Θ(2^n) and Θ(2n) respectively. 3. It transforms a relation of the form T(n) = 2T(n/2) + lg(n) into an equivalent relation solvable by the Master's theorem

    Copyright:

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

    AA - Laborator 4

    1. Rezolvati folosind metoda Master:


    a) T n=16T n/ 4n 2
    a=16, b=4 n
    f n=n2

    log b a

    =n

    f n=n =n =n

    logb a

    T n= n

    log b a

    b) T n=4T n / 2n
    a=4, b=2 n log a =n2
    f n=kn , k constant
    b

    f n=kn=On=O n 21=O n log a 1 =1


    T n=n log a = n2 caz 1
    b

    c) T n=2T n/ 2n 3
    a=2, b=2 n log a =n
    3
    f n=kn , k constant
    b

    c1)

    f n=kn3=n 3= n12 =n log a 2 =2


    b

    c2) 2 f n /2c f n , nn0


    2kn3 / 23ckn3 , nn0
    1/4c , nn 0
    Alegem c=1/ 4, n0=1 .
    Rezulta din cazul 3: T n=kn3 = n3 .
    d) T n=2T n/ 2n lg n
    a=2, b=2 n log a =n
    f n=kn lg n
    b

    caz 2: k n lg nn
    caz 1: k n lg nO n1 , 0
    caz 3: Aratam ca k n lg n n1 , 0

    lg n=n lg n caz 2

    k n lg n= n
    1
    c , n0 ai cn kn lg n , nn0

    cnklg n , nn0 cklg n/n , nn0

    Pentru n rezulta ca c0 ceea ce reprezinta o contradictie cu faptul ca c


    .

    Rezulta ca nu se poate aplica metoda Master.


    2. a) T n=2T n/2n lg n , T 1=1
    T n=2T n / 2n lg n

    20

    T n/2=2T n/ 22 n /2lg n/2

    21

    ...
    T n/2 k =2T n/2 k1n /2k lg n/2 k

    2 k

    Adunam relatiile de mai sus, consideram si faptul ca n=2 k1 si avem:


    k
    k
    T n=2 k1T 1 2in /2i lg n /2i =n1 nlg ni=
    i=0
    i=0
    k
    k
    k
    =n n lg n ni=n k 1n lg nn i=
    i=0
    i =0
    i=1
    =nnlg 2 nnk k 1/ 2=nnlg 2 n n/ 2lg n1lg n=
    =nnlg 2 n nlg 2 n/ 2 nlg n/ 2=nlg 2 n
    b) T n=2T n11 ,

    T 1=1

    T n=2T n11

    20

    T n1=2T n21

    21

    ...
    T 2=2T 11

    Adunam relatiile de mai sus si obtinem:

    2n 2

    n2
    n2
    T n=2n 1T 1 2i1=2n11 2i =2 n12n11/21=
    i =0
    i=0
    =2 n12 n11= 2n1=2n
    3. Rezolvati recurenta: T n=2T nlg n .
    Fie n=2 m
    T 2m =2T 2 m /2 lg 2m
    T 2m =2T 2 m /2 m

    Fie

    S m=T 2m . Atunci:

    S m=2S m/ 2m

    Folosim metoda Master pentru a rezolva aceasta recurenta:


    a=2,b=2 m

    log b a

    =m

    f m=m= m=m

    log b a

    Din cazul 2 avem:


    S m=m

    log b a

    lg m=mlg m

    T 2m =mlg m
    n=2 m m=lg n

    Rezulta ca: T n=lg nlg lg n .

    You might also like