There are many lecturers out there, very few are teachers. You are what I call a teacher. I love absolutely everything about your teaching. I love the pauses while explaining, it allows me more time to let the content sink in rather than having to pause the video. Absolutely love this. Thank you, Mr. Abdul.
Seriously. He is so good. :) Yesterday, I saw one of his video and not stopped till now. Slowly, giving Pause, he is explaining, and that's his beauty of teaching. Will recommend to everybody in my network to watch his tutorials in youtube and Udemy. Thanks, Abdul Sir.
Best algorithm class ever! I am a CS graduate student from a US university and I just took a class called principals of programming language which basically should teach me the exactly same thing as your lectures. After that class I still don’t really understand most concepts from the class. Your lectures explain all these concepts so clearly and I finally figure out the problems I have had for a long time...Thank you!
sir i was fully confused in this topic in previous two years in college..but when i saw these amazing video ...my all concept has been clear now...sir you are amazing...thank you sir
I have no words for your teaching. After wasting so much time in the university trying to understand what the teacher is saying, you are a breath of fresh air. You are an inspiration to all aspiring teachers, professors and researchers. I really wish you well in your life. Hope you get the best because that's what you deserve.
You are one of the very few "perfect teachers" that I have had the chance to learn from in my life. Excellent work, so helpful all this is when nothing else seems to be understandable. Thanks a lot!
I attended lecture at my university, read the textbooks, watched youtube videos but none of this explained me time complexity like you did! Great explanation sir, Thank you :)
It is only because of you i was able to transition from an Electronics student to a CS student.I m not boasting but i have became better than most of my CS friends also i have learned Data Structures and Algorithms using your course .I cannot thank you enough !!
Very helpful video sir..we want initially these types of basic concepts videos to make our basic algorithms concepts strong..huge respect and love for you sir ❤️🙏🙏🙏...
My college professors are your student🤭, even after learning from your videos they are unable to explain as you explain it in easiest way. Thanks to make our learning journey very interesting and enjoyable. Lot's of love 💞 from Prayagraj, India.
You are so original and to the point. You speak with so much clarity. Your videos are excellent. You cleared all the areas I was struggling with in my CS studies. Thank you.
They say that when you can truly simply complex questions into very simple solutions that is when you truly understand your material. The way you teach in your videos truly exemplify this. Thank you
one word amazing.. you are just amazing.... you are the teacher.... a true teacher.... I just love watching your videos... tomorrow is my paper.... not this subject.... but cannot stop myself to watch your videos.... love you, Respect you Sir... when you stop and look into the camera..... its look like you are watching us.... I cant stop to appreciate you at the moment... Love from Pakistan
Sir i am following ur videos for GATE preparation alongside some paid courses and I say that your teaching is very lucid, clear and in depth when compared to the paid ones. Keep up the good work Sir. Thank you very much for the efforts. Please upload videos in other topics like TOC, Compilers and Data Structures.
He has a udemy course on DATA STRUCTURES, I took that course, the course was really wonderful, simple, lucid, brilliant and what not! Just take it, its worth the money
I felt like after my algorithms class I really hadn't learned anything so I'm just reviewing for my pleasure and I looked at the Stanford algorithms course with that guy and the class is terrible. This is one of the easiest algorithms courses to understand on the internet really great work
I can't thank you enough Dr. Abdul. I'm struggling in my current algorithm class. Your video helped me sooo much to understand the material. Thank you!!!
You're awesome. You explain it so concisely and clearly. Thank you so much for this video, I finally feel like I completely understand time complexity.
Yes, I agree that is more reasonable, I think he made a mistake here because if you use n/2, neither example satisfies the formula, whereas the formula m/n is a close approximation, that should be the right answer, thanks
In the example shown for GCD, if we reverse the values of m and n , If n = 16 and m =2 , it will execute n/2 times, and if n grows very large( say 10000) and m is 2 , the denominator has negligible effect in execution time and i think that is explained here, the worst case hence it is O(n) and also he is saying the best case is O(1) based on values of M and N, this is what i am assuming, i may be wrong.
I’m also not convinced by this one because if we take (m = 20) and (n = 7), and vice versa, we will sometimes run the ‘if’ block and sometimes the ‘else’ block
Whenever sir is saying time complexity(in all examples till now), it is always Worst Case Time Complexity, therefore O(n). Whatever you guys are suggesting is not the worst time complexity, rather Average Case Time Complexity. And the Best Case Time Complexity is O(1).
After watching tons of videos I found this video very much useful and easy to understand.. !!! finally I learnt time complexity with lots of shortcuts .!!! Even i gone through Cormen but this video was much easier than any other books and videos..!!
I read many documents about time complexity and that too hard to understand, I saw all videos about complexity from your channel and it's very helpful for me and easy to understand. Thank you sir.
Sir sir this level of explanation I haven't seen in my life though I do have watched a lot of other videos but hat's off to you, boht boht shukriya Jazakallahu Khairan , May Allah bless you sir
I think these videos are best for algorithm and data structures. I understand this clearly. Thank for such an excellent videos.realy its a very big help. Thanks form bottom of my head 😍😍
Hi Sir, I have gone through your basics to advanced C++ course in udemy , it was wonderful and helped me a lot to code in C++, can you also please create a course on topics like Multithreading, async programming, and advanced topics on networks with C++
@@ekanshkhanulia4078 Guys, here by n/2, sir means generalized value of n, else for that particular question it is m/2 only. Just to represent it in standard from he said n/2. Hope you get it.
Hands down Sir! I would like to ask which textbook(s), in general, do you recommend in the data structure and algorithm too. Thank you for sharing your knowledge with us.
@Abdul Bari there seems to be a small correction at the end, where there is only if condition, then if condition is not met, the compiler doesnt run any line so only for the check 1 unit time is counter, therefore best case O(1) else O(fn) right
Excellent video. Your time complexities videos has cleared a lot of my doubts. Thanks a lot. Just one point I could not find in the video is "the impact of break on time complexity". If you could explain that part also, that would be great.
There are many lecturers out there, very few are teachers. You are what I call a teacher. I love absolutely everything about your teaching. I love the pauses while explaining, it allows me more time to let the content sink in rather than having to pause the video. Absolutely love this. Thank you, Mr. Abdul.
Seriously. He is so good. :) Yesterday, I saw one of his video and not stopped till now. Slowly, giving Pause, he is explaining, and that's his beauty of teaching. Will recommend to everybody in my network to watch his tutorials in youtube and Udemy. Thanks, Abdul Sir.
akash patra Same here 🙌
I must call you Dr. Abdul Bari and you have an expertise to teach in any top most university in the world. Jazak Allahu Khairan
lol
@@WildThoughtsAI she's actually correct
Joseph agreed
no doubt ...May he be blessed in abunduntce by Almighty.
He is the legend in algorithm
Best algorithm class ever! I am a CS graduate student from a US university and I just took a class called principals of programming language which basically should teach me the exactly same thing as your lectures. After that class I still don’t really understand most concepts from the class. Your lectures explain all these concepts so clearly and I finally figure out the problems I have had for a long time...Thank you!
sir i was fully confused in this topic in previous two years in college..but when i saw these amazing video ...my all concept has been clear now...sir you are amazing...thank you sir
I have no words for your teaching. After wasting so much time in the university trying to understand what the teacher is saying, you are a breath of fresh air. You are an inspiration to all aspiring teachers, professors and researchers. I really wish you well in your life. Hope you get the best because that's what you deserve.
Happy Teacher's Day Dr. Bari
Your videos will always be legendary
You are one of the very few "perfect teachers" that I have had the chance to learn from in my life. Excellent work, so helpful all this is when nothing else seems to be understandable. Thanks a lot!
If you were teaching at my university I wouldn't miss a single class.. we need more teachers like you
Big love and support from Seoul, South Korea! You are the best!👍
Year of 2024, you’re still the best professor of algorithm.
I attended lecture at my university, read the textbooks, watched youtube videos but none of this explained me time complexity like you did! Great explanation sir, Thank you :)
The hero we have, but we never deserved. Dr. Abdul Bari, you legend!
I paid for a course on Algorithms yet I've found your lectures more valuable. Thanks for sharing this for free.
Casablanca Morocco . FSBM 's students . we are here, and we thank you a 3ammi 3abdoul
It is only because of you i was able to transition from an Electronics student to a CS student.I m not boasting but i have became better than most of my CS friends also i have learned Data Structures and Algorithms using your course .I cannot thank you enough !!
I am planning to dedicate my notes of you all lectures as your fan . Just amazing Sir .
This guy's teaching is flat-out incredible. I can follow his videos having minimal questions because he explains everything clearly.
Very helpful video sir..we want initially these types of basic concepts videos to make our basic algorithms concepts strong..huge respect and love for you sir ❤️🙏🙏🙏...
My college professors are your student🤭, even after learning from your videos they are unable to explain as you explain it in easiest way.
Thanks to make our learning journey very interesting and enjoyable.
Lot's of love 💞 from Prayagraj, India.
In which semester you are ?
@@trendingstatusx549 4rth Sem
@@vikaskumargupta6427 are u placed
You are so original and to the point. You speak with so much clarity. Your videos are excellent. You cleared all the areas I was struggling with in my CS studies. Thank you.
They say that when you can truly simply complex questions into very simple solutions that is when you truly understand your material. The way you teach in your videos truly exemplify this.
Thank you
India really need more teachers like you.
I follow your videos for the last three years, really you are a very good teacher.
Abdul Bari Sir is our hero out there! 💜
I went from hating this subject to absolutely loving it ALL THANKS TO YOU SIR. WHAT A LEGEND!!!!
Sir, you are truly gifted with the talent of teaching. You make everything easy to understand. Thank you so much.
one word amazing.. you are just amazing.... you are the teacher.... a true teacher.... I just love watching your videos... tomorrow is my paper.... not this subject.... but cannot stop myself to watch your videos.... love you, Respect you Sir... when you stop and look into the camera..... its look like you are watching us.... I cant stop to appreciate you at the moment... Love from Pakistan
One of the best teachers on youtube..!! Not only the content but the examples are great
Sir i am following ur videos for GATE preparation alongside some paid courses and I say that your teaching is very lucid, clear and in depth when compared to the paid ones. Keep up the good work Sir. Thank you very much for the efforts. Please upload videos in other topics like TOC, Compilers and Data Structures.
He has a udemy course on DATA STRUCTURES, I took that course, the course was really wonderful, simple, lucid, brilliant and what not!
Just take it, its worth the money
You are a blessing for all students who want to become great coders. Your videos are superb.
I became your fan sir... Just 1 lecture and you kicked it.. Whachm.. ❤️❤️❤️
Thank you so much sir. After watching your this series of tutorials on algorithm, i took your c++ course on udemy. its simply awesome
Udemy is taking more data ... How did you manage that
@@harinireddy8423 Try reducing the quality of the video to 480p or try to get an Wi-fi connection.
I felt like after my algorithms class I really hadn't learned anything so I'm just reviewing for my pleasure and I looked at the Stanford algorithms course with that guy and the class is terrible. This is one of the easiest algorithms courses to understand on the internet really great work
Sir your teaching skill is on next Level , I'm indulging & enjoying the session like a delightful Pastry.😍🤩
I can't thank you enough Dr. Abdul. I'm struggling in my current algorithm class. Your video helped me sooo much to understand the material. Thank you!!!
You're awesome. You explain it so concisely and clearly. Thank you so much for this video, I finally feel like I completely understand time complexity.
@ 18:37 time complexity should be m/2. Also, for generalization it should be m/n where m > n.
Yes, I agree that is more reasonable, I think he made a mistake here because if you use n/2, neither example satisfies the formula, whereas the formula m/n is a close approximation, that should be the right answer, thanks
In the example shown for GCD, if we reverse the values of m and n , If n = 16 and m =2 , it will execute n/2 times, and if n grows very large( say 10000) and m is 2 , the denominator has negligible effect in execution time and i think that is explained here, the worst case hence it is O(n) and also he is saying the best case is O(1) based on values of M and N, this is what i am assuming, i may be wrong.
i guess it should be O (m/n) for m>n and O(n/m) for n>m
I’m also not convinced by this one because if we take (m = 20) and (n = 7), and vice versa, we will sometimes run the ‘if’ block and sometimes the ‘else’ block
Whenever sir is saying time complexity(in all examples till now), it is always Worst Case Time Complexity, therefore O(n). Whatever you guys are suggesting is not the worst time complexity, rather Average Case Time Complexity. And the Best Case Time Complexity is O(1).
After watching tons of videos I found this video very much useful and easy to understand.. !!! finally I learnt time complexity with lots of shortcuts .!!! Even i gone through Cormen but this video was much easier than any other books and videos..!!
I read many documents about time complexity and that too hard to understand, I saw all videos about complexity from your channel and it's very helpful for me and easy to understand. Thank you sir.
Sir , your lecture is really good. Students will get a thorough knowledge in algorithm subject. Thank you for your effort.
16:06 I really like these types of stuff. really awesome videos, sir. we pray to Allah for your well being, in this life and hereafter.
Leaning a lot from you sir even after working for 5 years in an MNC
Thank you for your hard work !!! your lessons are easy to understanding ... thanks again
amazing teacher! explains the concepts perfectly and lets me understand my confusing university lectures with ease
The best asymptotic Analysis lecture I have ever seen ....
Watching this today after 4 years, such a beautiful learning.
Celebrating this new year by watching your lectures. Happy New Year Sir!
It is a kind request that you start regular tutorials on UA-cam
No one can match your excellence sir! Thank you!
You are that Guru missing in my academics...... respect.
No words to explain... awesome lecture.....100% understandable
Your method of teaching is very use full or help full for us,as the method of your
teaching is very good
thank you professor!!!
love and big hugs from são paulo, brazil
glad to have found your channel. Sir, you are changing lives in ways none can imagine.
Anyone can watch all 86 videos without any Break.👏👏
You are legend Sir. 🙏🙏🙇
**** paid courses.
Thank you...so much sir....very well explained...and the topic is now crystal clear.....😇 blessed to have u Sir!!
no one can be as mush impressive as you are sir . Thanks for making such educative videos in such simple language .
Thank you so much for the help. Regards from the University of La Laguna, Canary Islands🇮🇨, Spain🇪🇸
I am a big fan of your video tutorials Dear Sir!
Sir sir this level of explanation I haven't seen in my life though I do have watched a lot of other videos but hat's off to you, boht boht shukriya Jazakallahu Khairan , May Allah bless you sir
King 👑 of DSA is Abdul sir❤️🔥
These videos deserve more likes. 1million views and just 16 thousand likes. Just don't forget to like
I think these videos are best for algorithm and data structures. I understand this clearly. Thank for such an excellent videos.realy its a very big help. Thanks form bottom of my head 😍😍
You deserve a billion subscribers, and to replace our Algorithm course instructor!
you are an amazing teacher ,you are #1 in simplifing complex things!
Excellent class on this topic. You make it very clear and easy for us. Heartiest respect to you ,sir.
Thank you so much Abdul Bari sir for teaching complex topics in a simple way.
Thanks too much for your videos. I saw many in order to pass Algoritims part 1 exam and I do it. Thank you.
Your videos and explanations are so great and clear!
The best video for understanding Time Complexity Analysis!
What a excellent way of teaching the student! You are doing a great job sir.
Excellent videos sir. By the way I would like to meet your editor 🤣😂😂
Hi Sir, I have gone through your basics to advanced C++ course in udemy , it was wonderful and helped me a lot to code in C++, can you also please create a course on topics like Multithreading, async programming, and advanced topics on networks with C++
You are the best sir. Thanks a lot for this great way of teaching and delivering such a tough object in a very simple way.
Thank you sir! You are doing a great service. I really like all the lessons I've listened till now.
بارك الله فيك
I understand now algorithm
الحمد لله رب العالمين
Sir, the maximum time complexity should be O(m/n) I believe... 18:12 for m>n..
Yes i too got m/n
Actually m/anything assumes the Order of m so inspite of m/2 or m/n, the order will be O(m)
another new insights.. jazakumullah khairan.
Thank you sir from Athens Greece.
sir you are best i never seen teacher like you... thank you... sir please make series on data structure please sir...
Very thankful and grateful for such teachers !!
man, this guy is just awesome
superb tuts
@Abdul Bari In the 18:10 question, the condition stops when m = n. so it executes 8 times. 8 times = 16/2 = m/2. How is it n/2?
Please let me know too,if you get the answer
@@ekanshkhanulia4078 Guys, here by n/2, sir means generalized value of n, else for that particular question it is m/2 only. Just to represent it in standard from he said n/2.
Hope you get it.
cant express my gratitude
Hiii..
You are a great tutor sir. God bless with good health
Hands down Sir! I would like to ask which textbook(s), in general, do you recommend in the data structure and algorithm too. Thank you for sharing your knowledge with us.
at 18:19, there is a boundary condition in the loop. If m = 0 and n=1, while(m != n) will be an infinite loop because m and n will never be equal.
it is a mistake the second condition should be m=n-m;
Keep going on this way!That was complete.
It is a very amazing explanation sir...you are very great sir 👏👍👌😀
Whatever you teach is understood in O(1)
You are best who taught DS so far
Thank you so much sir for making this available for free for us... Jazakallah
@Abdul Bari there seems to be a small correction at the end, where there is only if condition, then if condition is not met, the compiler doesnt run any line so only for the check 1 unit time is counter, therefore best case O(1) else O(fn) right
Excellent video. Your time complexities videos has cleared a lot of my doubts. Thanks a lot.
Just one point I could not find in the video is "the impact of break on time complexity". If you could explain that part also, that would be great.
@@abdul_bari Thanks a lot sir
Thank you Sir !! I really love your explanation about time complexity.
thankyou sir u are doing alot for students .may god bless you with happiness ,wealth and respect.
Outstanding explaination and teaching sir
Thank you for giving us such a liquid gold knowledge.
Abdul you're the king
bro is a legend fr