Scribd Logo
Upload

Welcome to Scribd!

  • 14 views

    Tut 10

    Uploaded by

    Shriom Kumar Singh
    This document summarizes the Akra-Bazzi formula for analyzing divide-and-conquer recurrences. It states that for a recurrence with the given form, the solution T(n) is asymptotically bounded by n^(1+p) * integral of g(u) from 1 to n, where p satisfies the condition that the sum of all ai*bi equals 1. It then applies this formula to a specific recurrence involving floor(n/3), finds p=1 and that T(n) is asymptotically Θ(n log(n)).

    Copyright:

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

    You might also like

    Tut 10

    Uploaded by

    Shriom Kumar Singh
    14 views1 page
    This document summarizes the Akra-Bazzi formula for analyzing divide-and-conquer recurrences. It states that for a recurrence with the given form, the solution T(n) is asymptotically bounded by n^(1+p) * integral of g(u) from 1 to n, where p satisfies the condition that the sum of all ai*bi equals 1. It then applies this formula to a specific recurrence involving floor(n/3), finds p=1 and that T(n) is asymptotically Θ(n log(n)).

    Original Description:

    Original Title

    Tut10

    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
    This document summarizes the Akra-Bazzi formula for analyzing divide-and-conquer recurrences. It states that for a recurrence with the given form, the solution T(n) is asymptotically bounded by n^(1+p) * integral of g(u) from 1 to n, where p satisfies the condition that the sum of all ai*bi equals 1. It then applies this formula to a specific recurrence involving floor(n/3), finds p=1 and that T(n) is asymptotically Θ(n log(n)).

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    14 views1 page

    Tut 10

    Uploaded by

    Shriom Kumar Singh
    This document summarizes the Akra-Bazzi formula for analyzing divide-and-conquer recurrences. It states that for a recurrence with the given form, the solution T(n) is asymptotically bounded by n^(1+p) * integral of g(u) from 1 to n, where p satisfies the condition that the sum of all ai*bi equals 1. It then applies this formula to a specific recurrence involving floor(n/3), finds p=1 and that T(n) is asymptotically Θ(n log(n)).

    Copyright:

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

    Student: Shriom Kumar Singh

    Entry No.:2021EE10642

    Tutorial submission for COL202(Discrete Mathematics)


    Tutorial 10

    For a divide-and-conquer recurrence T (n),


    k
    X
    T (n) = aiT (bin + hi(n)) + g(n) for n > 1
    i=1

    The Akra-Bazzi formula states that for the given below recurrence rela-
    tion, the solution to Tn is bounded asymptotially (Θ), and is given by,
      Z n  k
    p g(u) X p
    T (n) = Θ n 1 + p+1
    du , where p satisfies a i b i = 1
    1 u i=1

    By rearranging ⌊ n3 ⌋ in this question,


     n  nwe can obtain i = 1 and a1 = 3, b1 =
    1
    3 =⇒ p = 1, also, h1 = 3 − 3 and g(n) = n and all the required
    conditions to apply the formula are satisfied,
    i.e. T is well defined, a1 > 0, 0 < b1 < 1, |g ′(n)| = 1 (bounded) and as
    h1 < 1 clearly it is O(n/ log2 n).
    Now, after applying the formula, we obtain the asymptotic bound of T (n)
    as ,
    T (n) = Θ (n (1 + log(n))) = Θ (n log(n))
    We observe that the calculation of the asymptotic bounds is independent
    of hi(n) =⇒ the Akra-Bazzi formula bounds are independent of small
    perturbations in the decrements of n.

    You might also like