Scribd Logo
Upload

Welcome to Scribd!

  • UNIT I - Session 6

    Uploaded by

    Angeline R
    12 views6 pages
    This document introduces algorithm design and the substitution method for solving recurrence relations. It provides examples of using the substitution method to prove solutions to recurrence relations, such as showing that if T(n)=T(n-1)+Θ(n) then T(n)=Θ(n^2). It also includes a link to a YouTube video that further explains the substitution method.

    Original Description:

    18CSC204J - DAA - Unit 1

    Original Title

    UNIT I- Session 6

    Copyright

    © © All Rights Reserved

    Available Formats

    PPTX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document introduces algorithm design and the substitution method for solving recurrence relations. It provides examples of using the substitution method to prove solutions to recurrence relations, such as showing that if T(n)=T(n-1)+Θ(n) then T(n)=Θ(n^2). It also includes a link to a YouTube video that further explains the substitution method.

    Copyright:

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

    UNIT I - Session 6

    Uploaded by

    Angeline R
    This document introduces algorithm design and the substitution method for solving recurrence relations. It provides examples of using the substitution method to prove solutions to recurrence relations, such as showing that if T(n)=T(n-1)+Θ(n) then T(n)=Θ(n^2). It also includes a link to a YouTube video that further explains the substitution method.

    Copyright:

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

    UNIT I

    INTRODUCTION TO ALGORITM
    DESIGN
    Substitution method
    Guess the solution.
    Use induction to find the constants and
    show that the solution works.
    Example
    Another Example
     How to prove by the substitution method that
    if T(n)=T(n−1)+Θ(n)then T(n)=Θ(n2)
    Video Link
    https://www.youtube.com/watch?v=Zhhh9qpAVN0

    You might also like