2.4.1 Masters Theorem in Algorithms for Dividing Function #1
ฝัง
- เผยแพร่เมื่อ 24 ม.ค. 2018
- Masters Theorem for Dividing Functions
Explained All cases with Examples
PATREON : www.patreon.com/bePatron?u=20...
Courses on Udemy
================
Java Programming
www.udemy.com/course/java-se-...
Data Structures using C and C++
www.udemy.com/course/datastru...
C++ Programming
www.udemy.com/course/cpp-deep...
![[FULL EP.14] เซียนหรั่ง สอน มาร์ชจุ จับปูนา ฮากระจาย | เฮ็ดอย่างเซียนหรั่ง | One Playground](http://i.ytimg.com/vi/M8mPjd_T2lo/mqdefault.jpg)
This guy should be teaching all my CS professors.
😂
facxxxx
or at the very least be writing a textbook. In mine the first thing they wanna do after introducing the theorem is prove it and I'm like "How the fuck am i going to understand the proof behind the theorem if I am using this to prove things? Thats like some make the box that contains the scissors require scissors to open logic!"
Your CS teacher should see this😂
on god
Absolute legend. I couldn't see myself passing DSA without this man! Love how he stops and stares at me showing how simple it is.
Usually other teachers show 2-3 examples in a 10-20 min video and this man has shown us every type of example in just 16 min. No doubt that he is a living legend for me atleast
I mean it's basic substitution. Given the general case you can do the rest yourself. He is an extremely good teacher, but this is baaic substitution. No one spends a 10min video explaining the mappings between a variable and the number, it's obvious. Peace
@@georgeth4421 I sAy WhAtEvEr i WaNt
What about 2T(n/2) +2??
O(n)@@ntrfansclub8951
I have attended my M Tech class on Master theorem then repeatedly watched the M. Tech teacher's videos and also refereed the book but there was still something was not clear and it was like walking in dark tunnel ....Then I saw your video for 1 Hrs and thats it I can see the light. Now I am just checking the topics in book and directly opening your Videos ... You are my Guru ..Happy Teachers Day !!
Bro, I want to ask you
1. If this playlist contain practice problems
2. Will this playlist be helpful in GATE
3. Which is the best channel for learning DSA
@@saurabhsoni738 You can prepare for GATE from these videos..you can't find every gate problem but..your foundation on algorithms will be strong after watching sir's videos!! i am also preparing for gate'22 and i am referinfg this playlist
@@saurabhsoni738 yes bro sure
@@pragmatic_p8 so sis what is ur gate score n rank ??
nice
At the beginning I was like how the heck am I gonna remember all this, then after a few examples, boom! You’re good at this!
Mr. Bari, you are probably one of the best teachers that I have seen on these difficult subjects. I have some of your courses on Udemy and they have helped me out so much. Thanks for your efforts.
i wish you were the professor for algorithms in my school
He is an alumni of nit Warangal
Telangana
Whaaatt!! You had algorithm in ua school itself?
@@prasannanivas4575 I guess he means college
May Allah grant this main a high rank in Jannah
ameen :")
wait.....what!! this is to be said to a dead!
*man
ameen
Abe lodu
15:03 "You got a problem with me?"
bro!!!!!!!!!!!!! stop it. I bet your face will be worse if you were so into the algorithms.
@@jay-rathod-01 whooosh
Using these videos after 5 years for my masters to revisit the topics in US is a treat. Thanks!
I was allergic to this subject, you made me fall in love with it.
lol allergic
the 16 minutes that were better than the 2 hours by my professor, it's almost too good to be true.
you absolute legend
Mr. Bari you are absolutely the best in teaching Computer Science concepts. I wish all my professors were like you. Thank you so much for doing this for us!
One of the greatest teaching videos I've ever seen. You didn't just make it less scary, you made it fun. Thank you so, so, so much!
Amazing how well this is explained. I couldn't wrap my head around after watching my lecture and Mr Bari explained it in 16 minutes. Thank you so much!
In case 3,
if p > 0 then O(n^k*logn^p)
if p
Ya i felt the same!
Isn't it in Case 3, p>= 0 then THETA(n^k*(log n)^p), and p
it will be easier to remember
This was an excellent explanation. Thank you for simplifying the complexity, then going into the fundamentals of its complexity. Most CS videos fail to do this. Subscribed.
Wow. Just wow. So much clearer than anything else I have seen in my college-level data structures classes. This is amazing and I thank you greatly for uploading such valuable information onto the internet for others to learn.
4 minutes in, I was still thinking "I don't understand, this looks even harder than how the professor explained it."
7 minutes in, I'm starting to see the pattern and get it. I'm not a traditional computer science student, so this really helps.
it is hard for a traditional computer science student as well so dont think like we are some geniuses
so true T_T
Believe me Master's Theorem can't be explained better than this.
He is the *Master* in teaching Master's Theorm
everytime you explain something, you turn around and look at my face like "brother, so simple right". And I love it !!
You are one of the best online instructors I have ever seen on TH-cam. Thank you so much for these videos.
8:58 "Directly put it here". You're the best Sir ! Great Lesson !
I really thankful to you ABDUL BARI sir from the core of my heart. During 4 years of engineering in my college I was unable to get the concept of algorithm .then I started preparation for gate took coaching then also same with algorithm subject .but now I watch your videos and getting all the concept clear .and I also recommend my friends to watch your videos on algorithm to get the concept. May God Bless You.
I've been stressing so much because I wasn't quite grasping the material my professors were handing me, but since I have watched this I feel like I understand it! I love your videos, they help so many people!
15 min of this better than 1 hour lecture on master's theorem
Thank you sir. I just finished my exam. It was because of your videos that I passed. Love from Australia ☺️
Perfect I have 4 years of experience and I never could relate mathematical functions with computer functions. You have changed my view. I think this will improve my DS & Algo skills. You are brilliant, yet simple.
It was really helpful. Every college needs a tutor like you.Thank you so much for explaining the topic so well.
I have come across Masters theorem many times, but never got a grip on how exactly it happens without remembering the cases. Perfectly understood the idea now.. Thank you Sir!
I feel, lot of people have difficulty in understand this subject, you made it easy. Thanks a ton.
Wow in just 16 minutes you've explained this topic so much better than my professors. Well done and thank you!
Jazak Allah for clearing my concept..sir, you teach in very neat n clean way..Thank you!!
8:57 should be O(n^2*log(n)) since it is case 2 sub-case 1 (p = 0 => p > -1)
true
Yes👍🏻
Yes!
I thought as much.
Thanks
I really admire your contribution to youtube learning material. Your video have proved that my teacher is so lazy that he didn't give us a single hint that these knowledges exist. Once again, thank very much!
No words to explain how helpful your videos are. You made the algos so easy that even a 12th student can understand it thanx alot for your videos.
Man, he reminds me of one of my secondary school's accounting teacher. He explained every concepts with many examples like this. However, we were so dumb that we thought it was so dry and uncharismatic. Didn't help that he had a very calm and gentle demeanour so the whole class just walked all over him.
Now i realised that it is the most efficient way to acquire knowledge. I just wish I had the chance to tell him how much i appreciated him, so I'll use this chance to thank Mr Abdul Bari instead. Thank you sir, please continue to teach forever:)
What a clear and informative video. I did not understand anything concerning Master's theorem, and the algorithm book that is assigned to us over complicates its explanations. People like you make seemingly complex problems easy to approach. I wish all instructors can take a lesson from you on how lectures should be delivered. Thank you for committing time and effort to sharing this.
Before watching this video i had known every formula for the master theorem and solved all examples, now i forgot all the formulas but can solve all the problems of reccurence relation.... Great :)
Initially I started to learn with cormen book , got stuck , because I have been mainly working on web technology, therefore anyhow passed semester examination, later I realize a gap of core algorithm concept, started to learn in 6th semester, your videos made my path easy and gave it a great encouraging start, sticking with you for c++ programming too, Sir thank you for your quality content , Your videos raised my level ,
Hey viewers, if you are new here, stick here , this is the best algorithm lectures on TH-cam ,
You are just the best! Concepts are so neatly and clearly explained! Appreciated and thank you for the effort. Keep it up!
This video is the best one among all tutorials, books, and articles I went through. Thank you so much for this!
I wish I found your channel years ago. You took something that my professor made sound like rocket science and showed me how simple it is. Thank you
No hay nada mejor que ver que la manera en cómo usted explica. Saludes desde Colombia. Gracias!
You are a treasure for us ! The hardest topic in CS (Theoretical CS ) is so, because it not taught like this !!
Thank you very much for your time and patience !
Sir, you are such a great teacher, thank you for sharing your talent for the benefit of us.
YOU ARE AMAZING YOU HELPED ME WITH DATA STRUCTURES 6 MONTHS AGO AND NOW WITH ALGORITHMS ANALYSIS THANK YOU SO MUCH
Sir thank you too much I m doing my masters in the US and u are a better guru than people here.
I'm not subscribed to this channel, but every time I'm recommended one of his videos, I just come to give a like and head back to what I was doing. I don't watch his videos anymore but I'll always remain grateful for how he helped me back when I was in college.
You are the best tutor for this theorm. Very clear and understandable explaination!
Thanks Professor! You are the best! 我很喜欢你的作品！非常容易理解。
Chinese ?
GOD BLESS I was on the verge of tears because of how complicated this was explained to us but you just made life a lot easier
This guy should take my Data Structures' teacher's salary... My teacher can't explain anything properly but here Abdul Sir teaches us with full detail! Much appreciated!
Thank you so much, I tried viewing other tutorials for this theorem and I kept getting confused with the different variables but you made it very simple to understand what k and p are even if they are not present in the given recurrence equation!
Other teachers take thousands of rupees to teach this. But you and some other teachers are providing it for free. making every concept appear as simple as possible.
The way you teach is incredible
thankyou so much sir, u have developed the interest for algorithms❤
Master of Algorithm teaching us Masters Theorem
Hello Sir, I have been watching all of your videos. You are the best teacher so far, the way you explain is very understandable and we are really thankful for you. God bless you Sirji.
ok wow I am completely amazed by the way you put up this entire video. I watched it completely and did all the examples as exercises and boi am I ready for the test now
You're the reason I'm passing my algorithms course. Respects
You are one of the best teachers i have ever found. May God bless you sir. ♥
For the first time ever I finally understand this, thank you so much
I have heard by many people that abdul sir is The Best teacher of DSA and ADA they are absolutely right ❤
I don't even know how to express what is in my mind but thank you . I've learned from you more than from anyone or anything .
Sir, you are great! because of you I have regain my interest in CS
Glad to hear that!
No one could have explained this better! Thanks a lot.
None of my professors explains it better than he does. He's a LEGEND
Beautifully explained sir!! I understood this far better here, than from all the other sources I have referred to.
Clear and straight to the point! Thank you Sir. You videos are invaluable.
I have never seen such type of explanation ...
sir keep going ....
we support u!!!!!
Thank you for your service! You probably singlehandedly are helping me pass my complex algorithms module
Your video is excellent. You cleared all grey areas I had on Master Theorem. Thank you.
Dear Sir . You such a great teacher! .. It requires a very Giving heart to be a great teacher .. You have to be a wonderul person .. God Bless you!
Abdul, you are a hero. Thank you so much for your work. Really helping me understand these concepts! 🙏
Bless your heart. This was huge in helping me understand the master theorem. I appreciate the time you took to make this.
Sir you are just more than awesome .. i tried to understand in class but due to absence of mind i didnt get it well but when i come to ur video ... It really hits my mind and i understood it so well because of your awesome way
I love the look he gives after each explanation. As if he's making you understand.
Holy guacamole I love ya sir. My advanced algo instructor can't teach the first 6 minutes of this in an hour.
once again you have saved me from failing my algorithms course
7 minutes in and I understand you better than my professor's 3 hour lecture
went to lecture, understood nothing, read the textbook understood nothing... watched Abdul Bari, understood the concept sooooo well. thank you so much you are amazing!
Sir your style of teaching is very good. You explain the concepts in easy way. Thank you.
Earlier, I was stuck for K and P values, Now it's crystal clear, Thanks.
Excellent Explanation Sir. I could not understand Masters theorem when I read theoretically. I learnt it using Your videos . It is very useful & simple to understand. Thanks a lot !!! :-)
such a good explanation above and beyond anything I've seen
such important topics and you are teaching it for free...
respect for it..
I never comment on youtube videos but couldnt help this time. You are the algorithm king. Take a bow sir!
clarified all my doubts in master's theorem...best video on this topic !!!
I literally didn't love this theory part of my cs degree untill I found you
You are gem.
Thankyou endlessly for the great and simplified explanations!
I've never written a comment on youtube-videos before, but this video is simply amazing!!!!! Thank you so much for this!!!
Thanks a ton sir...for explaining it so well... awesome clarity.
Thank you very much for your video, I didn't understand the master theorem in class, but thanks to your video and your pertinent examples I finally know how it works 😁
Thanks a lot, didn't know it was this simple.
I now understand this thanks to you, great teacher.
Mr Abdul Bari Sir, you are a genius. I am so thankful for your videos. May god bless you with all happiness and good things in life.
amazing instructions sir, god bless you
it's is mindblowing!! i have been studying the Data Structure and Algorithms Made Easy book and it's first chapter is about Master Theorem and could not understand how is solving all the examples there. Found this video and just in second understanding everything. thanks you very much!
Kya padhaye hain ap Sirji! Fan ho gaye. I am in Stanford and even its professors cant explain at such ease
Sir, You are "The Master". Thank you!