Scribd
Upload
30 views14 pages

Lecture4 Solving Recurrences

This document discusses methods for solving recurrence relations, including the iteration method, substitution method, recursion tree method, and master method. It provides examples of using the substitution method to solve recurrences involving binary search, a recurrence with T(n) = T(n-1) + n, and a recurrence with T(n) = 2T(n/2) + n.

Uploaded by

yashkumarsahoo2003
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
30 views14 pages

Lecture4 Solving Recurrences

This document discusses methods for solving recurrence relations, including the iteration method, substitution method, recursion tree method, and master method. It provides examples of using the substitution method to solve recurrences involving binary search, a recurrence with T(n) = T(n-1) + n, and a recurrence with T(n) = 2T(n/2) + n.

Uploaded by

yashkumarsahoo2003
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 14

Analysis of Algorithms

Lecture 4
Methods for Solving Recurrences

• Iteration method

• Substitution method

• Recursion tree method

• Master method

05/04/2024
The substitution method

1. Guess a solution

2. Use induction to prove that the


solution works

05/04/2024
Substitution method
• Guess a solution
– T(n) = O(g(n))
– Induction goal: apply the definition of the asymptotic notation

• T(n) ≤ d g(n), for some d > 0 and n ≥ n0

– Induction hypothesis: T(k) ≤ d g(k) for all k < n

• Prove the induction goal


– Use the induction hypothesis to find some values of the constants d
and n0 for which the induction goal holds

05/04/2024
Example: Binary Search
T(n) = c + T(n/2)
• Guess: T(n) = O(lgn)
– Induction goal: T(n) ≤ d lgn, for some d and n ≥ n0
– Induction hypothesis: T(n/2) ≤ d lg(n/2)
• Proof of induction goal:
T(n) = T(n/2) + c ≤ d lg(n/2) + c
= d lgn – d + c ≤ d lgn
if: – d + c ≤ 0, d ≥ c

05/04/2024
Example: Binary Search
T(n) = c + T(n/2)
• Boundary conditions:
– Base case: n0 = 1 ⇒ T(1) = c has to verify condition:

T(1) ≤ d lg 1 ⇒ c ≤ d lg 1 = 0 – contradiction
– Choose n0 = 2 ⇒ T(2) = 2c has to verify condition:

T(2) ≤ d lg 2 ⇒ 2c ≤ d lg 2 = d ⇒ choose d ≥ 2c
• We can similarly prove that T(n) = 𝝮(lgn) and
therefore: T(n) = Θ(lgn)

05/04/2024
Example 2
T(n) = T(n-1) + n
• Guess: T(n) = O(n2)
– Induction goal: T(n) ≤ c n2, for some c and n ≥ n0
– Induction hypothesis: T(n-1) ≤ c(n-1)2
• Proof of induction goal:
T(n) = T(n-1) + n ≤ c (n-1)2 + n
= cn2 – (2cn – c - n) ≤ cn2
if: 2cn – c – n ≥ 0 ⇒ c ≥ n/(2n-1) ⇒ c ≥ 1/(2 –
1/n)
– For n ≥ 1 ⇒ 2 – 1/n ≥ 1 ⇒ any c ≥ 1 will work

05/04/2024
Example 2
T(n) = T(n-1) + n
• Boundary conditions:
– Base case: n0 = 1 ⇒ T(1) = 1 has to verify condition:

T(1) ≤ c (1)2 ⇒ 1 ≤ c ⇒ OK!


• We can similarly prove that T(n) = 𝝮(n2) and
therefore: T(n) = Θ(n2)

05/04/2024
Example 3
T(n) = 2T(n/2) + n
• Guess: T(n) = O(nlgn)
– Induction goal: T(n) ≤ cn lgn, for some c and n ≥ n0
– Induction hypothesis: T(n/2) ≤ cn/2 lg(n/2)
• Proof of induction goal:
T(n) = 2T(n/2) + n ≤ 2c (n/2)lg(n/2) + n
= cn lgn – cn + n ≤ cn lgn
if: - cn + n ≤ 0 ⇒ c ≥ 1

05/04/2024
Example 3
T(n) = 2T(n/2) + n
• Boundary conditions:
– Base case: n0 = 1 ⇒ T(1) = 1 has to verify condition:

T(1) ≤ cn0lgn0 ⇒ 1 ≤ c * 1 * lg1 = 0 – contradiction


– Choose n0 = 2 ⇒ T(2) = 4 has to verify condition:

T(2) ≤ c * 2 * lg2 ⇒ 4 ≤ 2c ⇒ choose c = 2


• We can similarly prove that T(n) = 𝝮(nlgn) and therefore:
T(n) = 𝝮(nlgn)

05/04/2024
Changing variables
T(n) = 2T( n ) + lgn
– Rename: m = lgn ⇒ n = 2m
T (2m) = 2T(2m/2) + m
– Rename: S(m) = T(2m)
S(m) = 2S(m/2) + m ⇒S(m) = O(mlgm)
(demonstrated before)
T(n) = T(2m) = S(m) = O(mlgm)=O(lgnlglgn)
Idea: transform the recurrence to one that you have
seen before
05/04/2024
Changing variables (cont.)
T(n) = T(n/2) + 1
– Rename: n = 2m (n/2 = 2m-1)
T (2m) = T(2m-1) + 1
– Rename: S(m) = T(2m)
S(m) = S(m-1) + 1
= 1 + S(m-1) = 1 + 1 + S(m-2) = 1 + 1 + …+ 1 +
S(1) m -1 times

S(m) = O(m) ⇒ T(n) = T(2m) = S(m) = O(m) = O(lgn)


05/04/2024
The recursion-tree method

Convert the recurrence into a tree:


– Each node represents the cost incurred at that level of
recursion
– Sum up the costs of all levels

Used to “guess” a solution for the recurrence

05/04/2024
05/04/2024

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy