2.2 Masters Theorem Decreasing Function

preview_player
Показать описание
Masters Theorem for Decreasing Function

T(n)=a T(n-b) +f(n)

case 1: if a less than 1 then T(n)=O(f(n))
case 2: if equal 1 then T(n)=O(n*f(n))
case 3: if a greater than 1 then T(n)=O(f(n) a n/b)

Courses on Udemy
================
Java Programming

Data Structures using C and C++

C++ Programming
Рекомендации по теме
Комментарии
Автор

When u said “this is masters theorem” after writing few master theorem itself in shock, I made this look so complex to even university professors and this guy is making fuN of GOD BLESS U....

syedjawahar
Автор

I can't explain to you how helpful these videos are to me. Thank you.

t.hartley
Автор

Angel has come down and explains the impossible

jojappakoyyuru
Автор

Wow!.. Never seen someone explain master's theorem so beautifully and passionately

arkadiptadas
Автор

I have never seen anyone dedicating 30 odd videos for explaining the complexity of the algorithms. Thanks to you sir, this is the best use of youtube I have ever done till date.

alldyallnite
Автор

Our teacher took 3 hours to teach these topics, but also after that no one was able to understand these clearly. But here you made it clear within a 8 minutes of lecture. I can't thank you enough.

anonymousa
Автор

Sir, massive respect to you.
I have never understood Master's Theorem in my college class. But thanks to you.
Regards,
Saurav

sauravdas
Автор

I was almost crying from how much work I had to do for my class and my professor didn't explain this topic that much and it's a crucial topic we need to understand. This video has helped me so much THANK YOU!!!

yoshifan
Автор

Greetings from America, and thank you very much! Your videos are some of the best I've seen. 🙂

JoseSanchez-vvzd
Автор

nothing short than legendry explanation. this series is the benchmark of algo teaching

g.c
Автор

You english is so fluent and easy going👍

prayagparikh
Автор

Mind-blowing explanation!! I used master's theorem for over an year, but never observed these subtle things. Wonderfully proved with examples.

chagantisubhash
Автор

Sir, you're true genius in teaching. Some people will only ignore it because of the thumbnail or your get-up. Your contents are gem.

dimitritizam
Автор

I can say it's the MOST complete and easy to understand playlist.

Just couldn't understand this Master Theorem before but with you I got it.
Respect to you sir

replykh
Автор

Its most simplified video exist on Master Theorem first observation then going through making the cases is just Lit i remembered very easily by writing on myself in the first go tysm

Raj
Автор

This guy is a GOD level teacher lol. Big thanks to U

eddiechen
Автор

Never come across such a Simple and Beautiful explanation so far. Further, the way to memorize the formulae is Fantastic.

c.d.premkumar
Автор

After watching one recurrence relation video i thought of skippin the rest ...but you explained each and every concept like our teachers do in our elementary school(spoon feeding) which made me not to skip atleast one lecture on this.
Thanks for last minute preparation.

satyaashokdowluri
Автор

Thank you my friend, LOVE FROM ROMANIAA !!!!

razvancarp
Автор

Sir, you are the great Algos tutor that I have come across so far. I am greatly inspired by your humility and patience.

happytrigger