Recurrence Relation Iteration Method
ฝัง
- เผยแพร่เมื่อ 2 ม.ค. 2019
- Solve the following recurrence relation using the iteration method.
►Algorithm Analysis Playlist:
• Algorithm Analysis (Ti...
►Big O Limit Videos:
(1) Solve Big Omega by Limits:
• Solve Big Omega By Limits
(2)Solve Big O by Limits:
• Solve Big-Oh By Limits
(3) Prove Little-o By Limits:
• Little o Proof Using L...
(4) Solve Big Theta By Limits:
• Solve Big Theta By Limits
►Easy Algorithm Analysis Tutorial:
www.udemy.com/algorithm-analy...
►Recurrence Relation Tutorial:
www.udemy.com/recurrence-rela...
►Please Subscribe !
/ @randerson112358
►Website: everythingcomputerscience.com/
►Support this channel on Patreon: / randerson112358
►Discrete Mathematics Workbooks:
(1) Practice Problems in Mathematics - www.amazon.com/gp/product/013...
(2)Discrete Mathematics Workbook - www.amazon.com/gp/product/013...
best video ever thank you!
Thank you!! I finally get it
thank you so much!!!
easy and understandable video ......u got my sub
thank you :)
Do you have any tips on how to determine if you should use a summation or just add the last bits of the equation? For instance,
𝑇(𝑛) = 4𝑇 (
𝑛/2) + 𝑛, 𝑇(1) = 1
The third iteration is eventually
64𝑇 (
𝑛/8) + 7𝑛
So instead of using a summation, the authors just added the 4n, 2n, and 1n. I hope this question makes sense. And thank you so much for the amazing videos!!
master theorem may help
Did not understand anything from the last minute of the video how it become 2*3n-1 ?????
yoo bro , just make the denominator common on both sides (i.e. 2 in this case)
What is the time complexity for this?
O(3^n) you noob
@@prat-man how do i know that? do i just take the variable related with n in this case?
watched more ads for the Super Bowl
I didn't get a single ad
too many ads
thank you :)