Iteration Method To Solve T(n)

Показать описание

Use the iterative technique to solve for T(n).
T (n) = T (n-1) + 1
T (1)= 1

Please subscribe !

Easy Algorithm Analysis Tutorial:

Recurrence Relation Tutorial:

►Discrete Mathematics Workbooks:

Рекомендации по теме

Комментарии

I dont know who u are but u saved my ass man. The other videos and notes aren't simple to follow at all. Thanks mate.

vinoshen

Absolutely the best video I've seen for the substitution method. Great job of showing how everything plugged in.

tatyanaroyer

sir what is the difference between substitution and iteration method???because u solved both of them in almost same method..kindly guide me.

breerahanif

i dnt know who you are i dnt know what you look like but i will find you and i will give you my salute

sumanghosh

wow wow wow !!! so awesome, thank u so much, really appreciate it ! thnkx

exoticme

i dont understand mine asks ‘is it possibke for t(n) to equal 42?”

ganjienthusiast

Thank you, this makes it so much simpler to understand.

BLANK

Hey, I love all your videos.
But is it possible to solve this using the master theorem?
I tried it as a=1, b=1, d=0. So we have logab = it would be H(n^0 log n) = H(log n)
Where am I failing?

warvimo

Vry gd explanation sir, but a small doubt I dnt find any difference between substitution n iteration mthd

chennalaanusha

Thank you, for some reason every other explaination lost me except this one!

kar

How does your camera move/adjust that way!!!?

daddymoist

Would I use iteration on T(n) = T(n-2) + 4? What method do I use with the constant is something other than O(n^something) or 1?

Michael

Thank You!
are the iteration method and the substitution method same?

interseting-funnyvids

Is there a video for the master theorem as well

abdelrahmankamel

to get T(1) shouldn't it be let k = n + 1? T(n) = T(n - (n - 1)) is T(-1) not T(1)? Unless I'm missing something?

BBLily

is iteration and substitution both techniques are same?

jaydangar

Freaking life saver man, thanks a lot!!

Prophetelf

I am searching for fibonacci sequence time complexity

sumanghosh

Iteration Method To Solve T(n)

Iteration Method To Solve T(n)

Iteration Method To Solve Recurrence Relation (Data Structure and Algorithms)

Solved Recurrence - Iterative Substitution (Plug-and-chug) Method

Solve Recurrence using Iteration Example1

L-2.3: Recurrence Relation [ T(n)= n*T(n-1) ] | Substitution Method | Algorithm

2.1.1 Recurrence Relation (T(n)= T(n-1) + 1) #1

T(n)= 2 T(n/2) + n/logn. Recurrence iteration method

15. T(n) = T(n-1) + 1 | Iteration Method | Recursion Tree | Solving Recurrence | DAA |

LeetCode 1: Two Sum Solution | Intuition + Brute Force + Hashmap Approach | Coding Interview Prep

20. T(n)=T(√n) + 1 | Iteration Method | Solving Recurrences | DAA |

Solve the Recurrence T(n) = T(2n/3) + 1 (Iteration Method)

2.3.2 Recurrence Relation Dividing [ T(n)=T(n/2)+ n]. #2

How To Solve Recurrence Relations

05-5 Solving recursion - iteration method

L-2.2: Recurrence Relation [ T(n)= T(n/2) + c] | Substitution Method | Algorithm

ITERATION METHOD to solve Recurrence Relations | Iterantion Method | Iteration method Discrete

L-2.9: Recurrence Relation [T(n)= 2T(n/2) +cn] | Recursive Tree method | Algorithm

Recurrence Relation T(n)= T(n/3) + T(2n/3) + cn | Recursive Tree Method | GATECSE | DAA

Recurrence Relation: Iteration method: Examples-Set1

T (n) = 3T(n/3) + n^3

Solve T(n)=T(n-1)+O(1) using Iteration Method || Example 3 || #Design_and_analysis_of_Algorithm

2.1.2 Recurrence Relation (T(n)= T(n-1) + n) #2

14 Solve the Recurrence relation using iteration method for 𝑻(𝒏)=𝑻(𝒏/𝟐)+𝑪

Iteration Method Example 1 || Solving Recurrences || #Design_and_analysis_of_Algorithm