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!!
best video ever thank you!
easy and understandable video ......u got my sub
thank you so much!!!
Thank you!! I finally get it
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
thank you :)
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?
too many ads
watched more ads for the Super Bowl
I didn't get a single ad
thank you :)