Master Theorem 

Thanks!

randerson112358 nah thankyou this is hopefully going to save me for my exam on Wednesday :')

@@randerson112358 Do you have any exemple of using Master's Theorem on an actual program? I'm having a hard time to get the f(n) correctly when I have tell the complexivity of a recursive program

Power of the internet my friend :)

exactly! I've been watching my teacher talk about this for a week and she never explained it this well.

+tiredkiris thanks very much!

I agree!!!!! thank you !!!!!

Thank you ! I try to respond to as many comments as possible. Thanks for watching and I hope it was helpful.

Thanks Zir, I hope you did well on your exam.

I think Professor Schnittgers scripts are great though^^ xD

Thanks for watching Gabriel

Glad you enjoyed the video and thanks for watching

That's awesome !

Thanks for watching Lucas !

Some other videos may indeed make it seem more complicated, but I hope my video helped !

Thank you Suhail

Thanks for the kind comment.

Thank you!

Thank you very much !

Exactly what I was thinking. I thought he had it on his head, or had a stabilizer.

Some phones have built-in optical image stabilization or he did it in a video editor, which could be what's causing this. In the case of the editor, it 'crops' the frame down a bit and uses algorithms to try to figure out where the camera is relative to the object being filmed, and uses that data to 'smooth' things out.

Thanks!

+faithless man thank you

Great ! Thanks for watching!

Haha thank you

Thanks for the nice complement !

Thank you!

Hi , This isn't my method it was popularized by the canonical algorithms textbook Introduction to Algorithms by Cormen, Leiserson, Rivest, and Stein, in which it is both introduced and proved. Not all recurrence relations can be solved with the use of the master theorem; its generalizations include the Akra-Bazzi method. So this would be one case which this method cannot solve, but in order to solve it see the links below and use those methods: Solve Recurrence by Iteration: www.google.com/url?sa=t&rct=j&q=&esrc=s&source=web&cd=5&cad=rja&uact=8&ved=0ahUKEwjhzoGnqI_PAhVFYJoKHe5AAvEQuAIINjAE&url=https%3A%2F%2Fwww.youtube.com%2Fwatch%3Fv%3DTEzbkIggJfo&usg=AFQjCNGV-zo1eD3sTWiHxYjWXI_WSynY9A&sig2=-rbnIJgSfIUCN7qoJbgwYQ Solve Recurrence when MasterTheorem Fails: www.google.com/url?sa=t&rct=j&q=&esrc=s&source=video&cd=1&cad=rja&uact=8&ved=0ahUKEwiU_orJqI_PAhWlCJoKHfy9CfEQuAIIHTAA&url=https%3A%2F%2Fwww.youtube.com%2Fwatch%3Fv%3D6s_O6uVLSso&usg=AFQjCNFgeMP_x5BvaavF9t5N1XPOHtuk2g&sig2=90alQGinjmrwSTyRsMTuyQ&bvm=bv.132479545,d.bGs Solve recurrence using Akra bazzi: www.google.com/url?sa=t&rct=j&q=&esrc=s&source=video&cd=2&cad=rja&uact=8&ved=0ahUKEwjR-O3RqI_PAhVrIJoKHTwZD-8QuAIIJTAB&url=https%3A%2F%2Fwww.youtube.com%2Fwatch%3Fv%3DGl2v9G0Rn4k&usg=AFQjCNFtnpo9YMUl9JjsB5gdM-p5xARC2A&sig2=dGlokJEAfC6KhOMTuCPttQ&bvm=bv.132479545,d.bGs Thanks for watching; Randerson112358

Thanks for the great comment and for subscribing !

Could you just tell me what to do when we have the following recursion C(N)=C(N-1) + N^2 what will the value of B be in this case? I have the exam in a few hours, if you could reply I would deeply appreciate it!

J. F. M. You cannot use the master theorem to solve that recurrence relation. Use the substitution/ iteration method ru-vid.com/video/%D0%B2%D0%B8%D0%B4%D0%B5%D0%BE-TEzbkIggJfo.html

Thank you so much!!! May I ask you one final thing? Given the following recursion C(N)=2C(N/2) + NlogN whats the value of d and how do you determine it?

Could you please at least tell me which theorem I'm supposed to use for this last recursion C(N)=2C(N/2) + NlogN

+Sumitha Vinil thanks for watching!

I chose d = logb(a) because it's a true statement from this example. Let me explain, d = 0, a = 1, b= 3/2 so log base (3/2) of 1is equal to 0 which is also the value of d. So d is equal to log base (3/2) of 1, or d = logb(a) I hope that helps! I also have a tutorial on solving recurrence relation using other methods: www.udemy.com/recurrence-relation-made-easy/learn/ Thanks for watching ; randerson112358

Thank you for watching!

Thank you !

Or is that Big O that you're using?

Glad it helped!

Haha hello, thank you all for watching!

Hey Dennis, thanks for watching !

Thank you !