2.4.2 Examples for Master Theorem #2

Examples for all cases of Master Theorem

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

Data Structures using C and C++

C++ Programming

[andrewescu]

I think what makes Mr. Abdul Bari such a great teacher is the fact that he understands sometimes it is more effective to show someone how to do something rather than merely tell them how to do it. College lectures a lot of the time are way too much telling and not nearly enough showing.

[krishnakabi]

I am very much grateful to you sir. Earlier I was very scared to even tap into this subject. I always thought the concepts are too tough. But you made it spectacularly easy. I am currently doing masters but don’t have CS background so I make sure I watch your videos thoroughly before attending my instructor’s lecture. You make these concepts relatively much easier. Thank you so much 😊

[antonstarostin]

Thank you for your videos!

For everyone else who was puzzled by the example at 1:31, here is the analysis:


T(n) = T(n/2) + n
log 2 (1) => log from 1 base 2 = 0
K = 1


There is no log^p (n) here, so assume p = 0.
P = 0 (log^0(n))

(log < k) then it's case 3.
This corresponds to option 1 (p >= 0).
Therefore the answer is O(n^k log^p (n)). Apply our variable and get O(n^1 * log^0(n)).

I saw several people asked the same question and this comment originally was pretty much the same, but finally, I realized that I was wrong :)

Thank you again!

[mvbmartins]

Thank you very much.
Your explanation turned it easily than I had learned before.
It is the power of internet.
If i had not found you, my path would be to much hard than it really was.

[janlycka]

Best ending - "That's all" :D. Very useful video, thank you

[Swansylinks]

You're my saviour from this course. May God increase you in all ramifications.

[richardholdbrook]

You are a very good teacher. It is 2023 and you are saving my semester. Thank you so much.

[sahil_more]

RESPECT ++10, 000
Honestly SIR your style of teaching is Super Awesome.

Thank you very much.

[subramaniyanvg]

Best examples I get confused when I try to solve some equation on my own. But worth it thanks sir.

[umeshmadushanth]

Super explaining sir, explanation is more than crystal clear
Understanding level is 1000%
Thank you very much sir
I felt much easier after watching these videos

[itsmeakash_]

Just by remembering the formulas I can solve them literally in a minutes. JUST WOW

[iqra]

Thank you so much Sir.
For making tough subjects easy to learn.

[MrColonelexe]

Thank you.. This video give me so much clarity than what my lecture did.

[jithinmv]

in case 3 last example, we should take Big-OH notation right?

[aditi]

sir what are we supposed to do if t(n) = t((n)^(1/2)) is given? How do we tackle the root in the RHS? Thanks!

[golubhattuk]

sir never asked to people to subscribe, people who respect his knowledge, and have brain subscribe by theirself

[AdityaGupta-zdsq]

very good explanation all school of computer science student should watch this playlist to strong the concept of design and analysis of algorithm..

[aliwahid]

you are a wonderful teacher
i hope i have teacher like you on all my subjects

[usamaalioffical]

You are the God of Algorithms.Your name should come in Guiness Book of world records for teaching best course on algorithms free of cost.May God Bless you and give you long health.Lots of Love and Best Wishes from Pakistan
One suggestion to give you...Kindly add code of algorithms in your videos and explain them and also should discuss what type of questions can come in paper from these algorithms.I am talking about exams in university

[JackyShaw]

Sir case 3 me when p<0 then answer should be in big O, right? Because that is what you have written in the Masters Theorem. But in the examples you always use theta...why?