4 years in Engineering. Never understood complexity. Found books like Cormen so repelling and complicated. 12 minutes of this video- hailing your brilliance! Thank you so much Abdul Sir. You are really a learned individual and a fantastic teacher.
*Key Takeaways:* - remember, runtime complexity is taking a look at how the *number of steps/instructions required* by the algorithm changes as a function of the *input size* of the algorithm - remember, space complexity is taking a look at how *memory required* by the algorithm changes as a function of the *input size* of the algorithm - the most straightforward way to find the number of steps/instructions required by the algorithm as a function of the input size, is to look at the pseudocode and *see how many times each instruction gets executed* . For example, some instructions will get executed just once, regardless of input size (these are usually initialization instructions). Some instructions will get executed n times (n being the input size), these instructions are generally inside a loop that loops the same number of times as the input size - at the end, add up all the number of times each instruction is being executed, weather it be 1 time, n times, n*n times, etc - take the biggest contributor of the resulting expression (the highest degree), that is your complexity - you *do a similar analysis when trying to find space complexity* . See which variables the function uses. Are they scalers? If so, they only take 1 unit of space. Are they arrays? Is the array as big as the input? That takes n units of space. Are they 2d arrays, each side being the same size as the input size? That will take n*n units of space. Just try to think how much space the function will take, based on the input size. Thanks! This was really helpful in finding out how to count the number of instructions required as a function of input size and also amount of memory units required as a function of input size, and then converting these counts to complexity notation (i.e. just keep the biggest contributer (highest degree)).
I am taking data structures at the moment, first week I was scared because I didn't really understand this concepts. Second week I was so lost, started reading a book and nothing, I feel more lost than what I was. Now? I am learning and understanding everything because of you. You have passion for this and also, you have the ability to educate other's so easily. Thank you so much Abdul! You are an amazing and fantastic teacher.
In my 4 years of engineering life and 3 + yrs of IT industry experience, I never understood the time and space complexity in just 12 minutes of your video. This is a totally brilliant way of teaching. Sir, I became a big admirer of your teaching skill. This video, I am going to share at my level best, and thank you so much for making the above concept so simple and easy for us. I have never understood this topic before. Keep up the great work. I understood each and every second of this video. I paused the video and tried from my end and obviously with your way of teaching, I got the correct time and space complexity. Thank you once again, Sir. I am blown away with your simplicity in teaching Great, great Sir.
this man deserves Millions of subsribers, Hats off even i did'nt learned these concept in my university Millions prayers for you sir Love from Pakistan
Very few people have this clarity in Algorithms. Those who are good at it are working in big companies they are busy doing their work. Those who are not very good at it are left to teach us in colleges. And the popular Books were written by the experts who treat us as their colleagues and discussing with us as if we were doing research work along with them.
Honestly sir, I don't comment on RUclips but you are the Greatest Of All Time. Been 10 years since you uploaded these videos and never have I had a concept explained so clearly to me ever. Thank you for your service to the student community sir. May you stay healthy and get whatever you want in your life because nobody deserves that more than you do
I AM A MASTERS COMPUTER SCIENCE STUDENT CURRENTLY IN SILLICON VALLEY HOWEVER I HAD PROBLEMS UNDERSTANDING TIME COMPLEXITIES, ONE OF MY FRIENDS SUGGESTED YOUR CHANNEL AND CHEERS TO YOU THAT NOW ALL MY DOUBTS ARE CLEARED AND I UNDERSTAND THE CONCEPT CLEARLY, THANK YOU PROFESSOR, GOD BLESS YOU.
the time and space complexity were like a headache, but after I watched your class they become cute to me :). Thank you for posting such an amazing lecture.
🎯 Key Takeaways for quick navigation: 00:13 🔄 *The Frequency Count Method is used to analyze the time complexity of algorithms by assigning one unit of time for each statement.* 03:55 🕐 *Time complexity for finding the sum of elements in an array using a loop is \(O(n)\), where \(n\) is the size of the array.* 05:47 🔄 *Time complexity for finding the sum of two matrices is \(O(n^2)\), and the space complexity is also \(O(n^2)\).* 08:45 🕑 *Time complexity for multiplying two matrices is \(O(n^3)\), and the space complexity is \(O(n^2)\).* 11:06 📊 *Analyzing different algorithms helps understand their time and space complexities using the Frequency Count Method.* Made with HARPA AI
Mind blowing! He breaks it down to where babies can comprehend. The issue with many teachers is that they can only communicate their teachings effectively based on their own limitations of clarity. Great lesson!
Hi Sir, your videos are THE best ones from RUclips. I searched through dozens of videos to figure this out and yours is exactly what I was searching for. I would never forget the concepts after seeing your explanations. You're helping millions! Thank you so much from the bottom of my heart!
I really really really like the calmness & piece with which you explain because it makes even the most complicated topics easier , i mean you don't explain with hustle & bustle , you explain everything step by step , explain it neatly & cleanly , big applause for u Sir 👍👏👏👏👏
learning becomes easy to a great extent when we get teachers like you ....the way you teach clears all my doubts with a crystal clear clarification ....thanks from the bottom of my heart....:)
Since my undergraduate studies up to the postgraduate level, I've struggled to grasp the concept, but your explanation today has clarified it exceptionally well. I truly appreciate your thoroughness in breaking down the topic. I haven't come across a video on RUclips that explains it as effectively as you did. Thank you so much, sir.
This 12 mins video clears my concept of time and space count methods, thanks alot sir for helping millions of students around the world. Allah bless you. we had never been taught in this way in universities.
I'm currently taking my 2nd algorithm class in college, and trust me, Time complexity barely makes any sense until I watched this video. Big THANKS my man. I just subscribed because of this video.
Wonderfully explained , better than paid courses which I have enrolled in . Every time I see the topic in my paid course, I come back here and understand it. Thanks you so much sir , you are a great teacher 👍
I am confused. I was taught that every time you initialize (i=0) as well as you increment i (i++) must be included into the frequency. Which is why the line for(i=0; i
I am also not convinced with n+1 for outer loop instead of 2n+2. But if I go with n+1 then everything else seems correct. Initially I thought you're right but I ran it on a piece of paper for n = 3. And the info in the video is correct assuming outer loop is n+1
I've seen many series that explain Algorithm analysis it was so boring and hard to understand but this series is just amazing ! really thank you for this brilliant work .
Sir, you are an excellent teacher. I have been watching your videos and the thing that I like the most is you have made the concepts look very simple that many of the teachers/experts struggle/fail to do. Video/audio/presentation style/clarity everything is great in your lectures. Thanks a lot.
3 years passed in my computer science study , i Never understood complexity but now i got the clear picture about time and space complexity sir really excellent teaching method. i will defiantly enroll your udemy courses as soon as possible
I've been struggling with algorithms. Missed out on job opportunities with fortune 500 companies, and almost gave up. After watching this video, I feel so powerful and knowledgable. Thank you sir.
Sir you are the only one person who clearly classify the exact difference between the asymptotic notation and cases. Thank you for your wonderful contribution.
Same for me - i was struggling with complexity since i was looking at algorithms.. but your explanation is cristal clear and so perfect to follow and finally understand! 😁 It´s a precious gift you have to explain things in a coherent manner - thanx a million!!
I used to hate algos before watching your videos but the way you teach it with the basics of maths , you really made it interestfull . Really Thank you sir !!
You are amazing, i just did these on my Game programming course... and i could not get it at all by the way the teacher was phrasing it. Thank you, you made life so much easier.
Hello, Could you help me please ?, at 10:46 the teacher said the f(n) eqauls 2n^3+3n^2+2n+1 about the part (2n+1) it shouldn't be (3n+1) ...?! because there is clearly 3 of (n+1) I can't understand why this happened.
Sir, Thank you so much! After watching your video, now I can solve the time and space complexity.of an algorithm. You taught me something I couldn't understand in the class.
i really want a professor like u in my clg..love the way u explain everything in such a pace and in a very understandable language..Thank you so much Abdul Sir..you are a perfect example of an amazing teacher..
Even though he has a heavy English accent for my ears, his teaching style and his pace makes it 1000% more understandable that most English speaking professors.
My DSA is all rusty and have recently started working recall them again. But hell if I had originally went through these videos, I would not have forgotten! So, I generally take key notes going through these theoretical videos and this is how I started with this video: Frequency count method 💎 link => because these videos are gems
Thank you so much for going through the concept of algorithms in a very clear and concise way. I was struggling to comprehend the time complexity escpecially until I saw your videos. You deserve all the subscribes you have and more. I am glad I'm one of them now.
I am in 2nd yr of engineering, in 3rd sem i had this topic, time complexity, that time I egnored it cause I never understood it, but after watching this vedio, I realise that why did'nt I watched your lecture on that sem. Now I understood it only beacause of you sir, thank you verry much.
You are a great teacher, Sir. First of all I want to thank you much for doing this affordable class on Algorithms, there are not too many ads too. Admire the effort taken to make it visible, clear and understandable for viewers. Sometimes I feel that you are going too fast during calculations, but it is ok because we are able to pause, do our own calculations and resume.
The best thing I like about your lectures first obviously your way of teaching. Second and the most important one that at the end you always give us a full view of board so that we can take screenshots and save it. 🔥♥️
nyc video sir... but at 3:00 u should mention y we take n +1 time complexity because we always takes the highest time complexity rather than taking other having less time complexity
I think it was not about highest time complexity at all. he mentioned that we are doing the basic analysis and we don't want to go too deep. therefore he took (n+1) instead of (2n+2) which it should be if you take a closer look at the "for" line.
mind blowing way of explaining time and space complexity! must watch for all developers!! I'm SO glad I found this channel! Thank you so much for sharing your knowledge
Hello, Could you help me please ?, at 10:46 the teacher said the f(n) eqauls 2n^3+3n^2+2n+1 about the part (2n+1) it shouldn't be (3n+1) ...?! because there is clearly 3 of (n+1) I can't understand why this happened.
@Abdul Bari, God bless you for making available your know knowledge from far away from wherever you are. You have no idea how your tutorials are elevating my algorithm concepts to a CS undergraduate level. Once again, thank you.
![BLACK BAG - Official Trailer [HD] - Only in Theaters March 14](http://i.ytimg.com/vi/Du0Xp8WX_7I/mqdefault.jpg)
4 years in Engineering. Never understood complexity. Found books like Cormen so repelling and complicated. 12 minutes of this video- hailing your brilliance! Thank you so much Abdul Sir. You are really a learned individual and a fantastic teacher.
cormen 🤣🤣🤣
my sir say cormen is The Bible algorithm 😒😒😒😒
really i hve generated hate towards this word "cormen"
You didn't understand time complexity in 4 years?
Then suggest me alternate book to cormen..
@@w0lfr4m_ true
You are right Shaurya.
5 years have passed but still there is no content on youtube that comes close to this quality, hats off to you sir!!
not even in paid course too really amazing
This man is my hero. I remember seeing his videos in college. Now I am a software engineer still reviewing his videos.
It is important I am 2nd year student of CSE
*Key Takeaways:*
- remember, runtime complexity is taking a look at how the *number of steps/instructions required* by the algorithm changes as a function of the *input size* of the algorithm
- remember, space complexity is taking a look at how *memory required* by the algorithm changes as a function of the *input size* of the algorithm
- the most straightforward way to find the number of steps/instructions required by the algorithm as a function of the input size, is to look at the pseudocode and *see how many times each instruction gets executed* . For example, some instructions will get executed just once, regardless of input size (these are usually initialization instructions). Some instructions will get executed n times (n being the input size), these instructions are generally inside a loop that loops the same number of times as the input size
- at the end, add up all the number of times each instruction is being executed, weather it be 1 time, n times, n*n times, etc
- take the biggest contributor of the resulting expression (the highest degree), that is your complexity
- you *do a similar analysis when trying to find space complexity* . See which variables the function uses. Are they scalers? If so, they only take 1 unit of space. Are they arrays? Is the array as big as the input? That takes n units of space. Are they 2d arrays, each side being the same size as the input size? That will take n*n units of space. Just try to think how much space the function will take, based on the input size.
Thanks! This was really helpful in finding out how to count the number of instructions required as a function of input size and also amount of memory units required as a function of input size, and then converting these counts to complexity notation (i.e. just keep the biggest contributer (highest degree)).
I literally cant express my gratitude towards you sir.... a big big thank you sir u explained in a great way
Thik Hai Bhai
This dude really understands algorithms so that he can explain with such clarity. Thank you for the video!
I am taking data structures at the moment, first week I was scared because I didn't really understand this concepts. Second week I was so lost, started reading a book and nothing, I feel more lost than what I was.
Now? I am learning and understanding everything because of you. You have passion for this and also, you have the ability to educate other's so easily. Thank you so much Abdul! You are an amazing and fantastic teacher.
the patience with which he teaches is appreciable.
His style of teaching would make a grade four pupil score an "A" in a CS course.
Alhamdulillah - revisiting from US, already did in 2021, Hyderabad, even top universities in US recommend us your videos. Thank you and Jazak Allah.
In my 4 years of engineering life and 3 + yrs of IT industry experience, I never understood the time and space complexity in just 12 minutes of your video. This is a totally brilliant way of teaching. Sir, I became a big admirer of your teaching skill. This video, I am going to share at my level best, and thank you so much for making the above concept so simple and easy for us. I have never understood this topic before. Keep up the great work. I understood each and every second of this video. I paused the video and tried from my end and obviously with your way of teaching, I got the correct time and space complexity. Thank you once again, Sir. I am blown away with your simplicity in teaching Great, great Sir.
Sunbe Space Complexity galat smjh liya hai tu 🤣
Iss Algorithm ki space Complexity O(1) hai.
This tutorial is better than most tutorials out there on Algos.
Amazing work
This is a thousand times better than all the Udemy courses I ever saw on CS. Not even books. Thumbs up.
My heartiest prayer & greeting will be for you. (from Bangladesh)
this man deserves Millions of subsribers, Hats off
even i did'nt learned these concept in my university
Millions prayers for you sir
Love from Pakistan
Very few people have this clarity in Algorithms. Those who are good at it are working in big companies they are busy doing their work. Those who are not very good at it are left to teach us in colleges. And the popular Books were written by the experts who treat us as their colleagues and discussing with us as if we were doing research work along with them.
😊
Honestly sir, I don't comment on RUclips but you are the Greatest Of All Time. Been 10 years since you uploaded these videos and never have I had a concept explained so clearly to me ever. Thank you for your service to the student community sir. May you stay healthy and get whatever you want in your life because nobody deserves that more than you do
I AM A MASTERS COMPUTER SCIENCE STUDENT CURRENTLY IN SILLICON VALLEY HOWEVER I HAD PROBLEMS UNDERSTANDING TIME COMPLEXITIES, ONE OF MY FRIENDS SUGGESTED YOUR CHANNEL AND CHEERS TO YOU THAT NOW ALL MY DOUBTS ARE CLEARED AND I UNDERSTAND THE CONCEPT CLEARLY, THANK YOU PROFESSOR, GOD BLESS YOU.
I never understood time and space complexity, and now just in 12 minutes I already know how it works, Thank you so much!!!, You are a great teacher!!
May Allah swt increase ur ilm(knowledge) more ......Ameen
Thank you so much sir , for your describe
the time and space complexity were like a headache, but after I watched your class they become cute to me :).
Thank you for posting such an amazing lecture.
🎯 Key Takeaways for quick navigation:
00:13 🔄 *The Frequency Count Method is used to analyze the time complexity of algorithms by assigning one unit of time for each statement.*
03:55 🕐 *Time complexity for finding the sum of elements in an array using a loop is \(O(n)\), where \(n\) is the size of the array.*
05:47 🔄 *Time complexity for finding the sum of two matrices is \(O(n^2)\), and the space complexity is also \(O(n^2)\).*
08:45 🕑 *Time complexity for multiplying two matrices is \(O(n^3)\), and the space complexity is \(O(n^2)\).*
11:06 📊 *Analyzing different algorithms helps understand their time and space complexities using the Frequency Count Method.*
Made with HARPA AI
sir i really thanks you from core of my heart for providing the quality content for dsa.👍
Mind blowing! He breaks it down to where babies can comprehend. The issue with many teachers is that they can only communicate their teachings effectively based on their own limitations of clarity. Great lesson!
Hi Sir, your videos are THE best ones from RUclips. I searched through dozens of videos to figure this out and yours is exactly what I was searching for. I would never forget the concepts after seeing your explanations. You're helping millions! Thank you so much from the bottom of my heart!
I really really really like the calmness & piece with which you explain because it makes even the most complicated topics easier , i mean you don't explain with hustle & bustle , you explain everything step by step , explain it neatly & cleanly , big applause for u Sir 👍👏👏👏👏
learning becomes easy to a great extent when we get teachers like you ....the way you teach clears all my doubts with a crystal clear clarification ....thanks from the bottom of my heart....:)
Since my undergraduate studies up to the postgraduate level, I've struggled to grasp the concept, but your explanation today has clarified it exceptionally well. I truly appreciate your thoroughness in breaking down the topic. I haven't come across a video on RUclips that explains it as effectively as you did. Thank you so much, sir.
This 12 mins video clears my concept of time and space count methods, thanks alot sir for helping millions of students around the world. Allah bless you. we had never been taught in this way in universities.
Nobody in this entire website nailed a time and space complexity tutorial like Bari Sir. I owe you a big one. A great teacher.
After 6 years, Your videos are still seeing and I also find them very informative.Appreciated 👏
I'm currently taking my 2nd algorithm class in college, and trust me, Time complexity barely makes any sense until I watched this video. Big THANKS my man. I just subscribed because of this video.
Wonderfully explained , better than paid courses which I have enrolled in . Every time I see the topic in my paid course, I come back here and understand it.
Thanks you so much sir , you are a great teacher 👍
I am confused. I was taught that every time you initialize (i=0) as well as you increment i (i++) must be included into the frequency. Which is why the line for(i=0; i
I am also not convinced with n+1 for outer loop instead of 2n+2. But if I go with n+1 then everything else seems correct. Initially I thought you're right but I ran it on a piece of paper for n = 3. And the info in the video is correct assuming outer loop is n+1
Sir you're such a brilliant teacher I ever seen ❤️
Take love from Bangladesh 🇧🇩
I already have notes for algorithms, but your teaching style is unique and easy to understand. Such a legend you are sir!
Sir I am not from cse dept but you just made the concept so clear its really commendable. Great work sir
jo me 4 saal me samajh nai paya...aaj ek bs kuch video me sara clear kar deya sir aapne.....dandawat pranam aaise gurujii ko
I've seen many series that explain Algorithm analysis it was so boring and hard to understand but this series is just amazing ! really thank you for this brilliant work .
sir i could never understand how to calculate t.c and s.c till end of my 3rd semester but then i came across your course. Hats off to you sir!
Sir, you are an excellent teacher. I have been watching your videos and the thing that I like the most is you have made the concepts look very simple that many of the teachers/experts struggle/fail to do.
Video/audio/presentation style/clarity everything is great in your lectures.
Thanks a lot.
Amazing video! I appreciated the tiny pauses that you provided - they let the information really sink in. Thank you!
3 years passed in my computer science study , i Never understood complexity but now i got the clear picture about time and space complexity
sir really excellent teaching method.
i will defiantly enroll your udemy courses as soon as possible
This is an outstanding video to watch. Within a few mins, I understood time & space complexity! No one has ever explained this way at all. Thank you!
This is the final stop for me on Time and Space complexity after going through many tutorials. Thank you Abdul!!!
I've been struggling with algorithms. Missed out on job opportunities with fortune 500 companies, and almost gave up. After watching this video, I feel so powerful and knowledgable. Thank you sir.
i love how you teach from the scratch this was so clear and easy to understand thank you so much!
i was looking for this explanation only , now after 8 years later i got my doubt clear, Thanks a lot Sir
Sir you are the only one person who clearly classify the exact difference between the asymptotic notation and cases. Thank you for your wonderful contribution.
Same for me - i was struggling with complexity since i was looking at algorithms.. but your explanation is cristal clear and so perfect to follow and finally understand! 😁 It´s a precious gift you have to explain things in a coherent manner - thanx a million!!
I used to hate algos before watching your videos but the way you teach it with the basics of maths , you really made it interestfull . Really Thank you sir !!
im currently taking a dsa class and i've learned more in 12mins than the pass 3 weeks, thank you
You are amazing, i just did these on my Game programming course... and i could not get it at all by the way the teacher was phrasing it. Thank you, you made life so much easier.
Hello, Could you help me please ?, at 10:46 the teacher said the f(n) eqauls 2n^3+3n^2+2n+1 about the part (2n+1) it shouldn't be (3n+1) ...?! because there is clearly 3 of (n+1) I can't understand why this happened.
Sir, Thank you so much!
After watching your video, now I can solve the time and space complexity.of an algorithm.
You taught me something I couldn't understand in the class.
The teachers themselves do not understand in college and that is why the graduates passing out of colleges are dumb.
Okay.
Space Complexity of this Algorithm is O(1).
@@rishabhjha447 how bro?can you explain?
so glad to find this channel. like how is everything getting into my brain so easily. its really the teacher man
Thank you so muhc. In 10 minutes you explained something my uni was trying to explain for 2 years.
Thank you so much for this clear, straight forward explaining..Jazaku allah Khairan.. Happy to find your channel
Thank you for such clear and a beautiful explanation.very interesting vedio. Iam thankful to find this channel😊. May god bless you💯
You made my life easy. I love your lectures. The minor details you have presented in your lecture. Your method of teaching is awesome.
It's a most simplest vedio of frequency count on youtube!! Feeling blessed that i got this vedio.😀
Best video for time and space complexity, I have ever watched from my engineering till date.
awesome teacher in entire google abd youtube videos
i really want a professor like u in my clg..love the way u explain everything in such a pace and in a very understandable language..Thank you so much Abdul Sir..you are a perfect example of an amazing teacher..
This algorithm playlist is a gem .....Thank you abdul sir for this life changing playlist.
Have to put a thankful comment here. The course that I paid for my degree messed it up and I found you sir.
The level of brilliance you have in teaching, sir! Awesome explanation.
These lectures are one of the best you will ever get.
I Love his teaching 👌
Reading through all the comments removed my doubts about this playlist of tutorials.. Now all I have to do is invest my time in it. Bismillah
Even though he has a heavy English accent for my ears, his teaching style and his pace makes it 1000% more understandable that most English speaking professors.
Tomorrow is my exam, and after watching your video, I have no doubts left. Your teaching method is really good. I have subscribed to your channel.
the best teacher in the whole world for me, because I am getting all things here. Thanks, Sir
My DSA is all rusty and have recently started working recall them again.
But hell if I had originally went through these videos, I would not have forgotten!
So, I generally take key notes going through these theoretical videos and this is how I started with this video:
Frequency count method
💎 link => because these videos are gems
Same here, it's difficult remembering all of these things, when you don't use it on the job.
Every teacher should teach like this .... in this kinda simple way ... Thanks sir u r one of the best teachers out there ...
My heartiest prayer & greeting will be for you. (from Bangladesh) (2)
I can't understand how simple this is after your explanation... you sir are a genius. Thank you!!
Wow. I'm in love with your teaching style 🥰. Thank you very much.
This is really going great, I'm gonna finish the 84 episodes, thank you very much sir.
Thank you so much for going through the concept of algorithms in a very clear and concise way. I was struggling to comprehend the time complexity escpecially until I saw your videos. You deserve all the subscribes you have and more. I am glad I'm one of them now.
Indeed he is a very very good teacher i wish i had teacher like him in the past. I am glad that i found this channel
Excellent video! This explanation helped me a lot! There are no words to describe how much grateful I am Mr Abdul! Thank you very much!
I am in 2nd yr of engineering, in 3rd sem i had this topic, time complexity, that time I egnored it cause I never understood it, but after watching this vedio, I realise that why did'nt I watched your lecture on that sem. Now I understood it only beacause of you sir, thank you verry much.
Protect This Legend at all cost
Best teacher in the world! Thank you so much for your helpful video!
A simple and elegant way of teaching Abdul Sir, you're amazing. I would buy your course soon.
Thank you for this sir. Watched the first 4 videos and I could easily grab the basic concepts.
Next Level explaination !!
what a quality content with great teaching .
May Allah Bless you sir ....!!!!!!!
❤ from Jummu and kashmir
Thank you, Just started watching your lecturers and they are amazing, keep up the great work.
You are a great teacher, Sir. First of all I want to thank you much for doing this affordable class on Algorithms, there are not too many ads too. Admire the effort taken to make it visible, clear and understandable for viewers. Sometimes I feel that you are going too fast during calculations, but it is ok because we are able to pause, do our own calculations and resume.
The best thing I like about your lectures first obviously your way of teaching.
Second and the most important one that at the end you always give us a full view of board so that we can take screenshots and save it.
🔥♥️
Pure 4 sal k engg me mujhe ye samjh ni aaya aur aaj apke 5 min k video me pura clear ho gya thank u sir
i was very confused till now ,,about complexity,but your videos made me think easy..thanku
I have started watching Your Videos by watching this video Now I'm learning all the concepts discussed by you in this playlist!
This is the best!!!! You could not have taught this better and I thank you so much good sir!
Mind-blowing, he is above all the institutes
this is much much better than freecodecamp and multiple courses in udemy, udacity etc. thank you for your amazing explanation!
Sir I never liked algorithms but I really like your videos - saved lives - thank you
You just Saved Me From Going To Depression Sir 😢 I Just Get Rid Of This Topic From My Life
nyc video sir... but at 3:00 u should mention y we take n +1 time complexity because we always takes the highest time complexity rather than taking other having less time complexity
Look at the previous video u will find it
Hey !
The condition was tested (n+1) times while the loop body got executed n times.
I think it was not about highest time complexity at all. he mentioned that we are doing the basic analysis and we don't want to go too deep. therefore he took (n+1) instead of (2n+2) which it should be if you take a closer look at the "for" line.
your explanation is outstanding👏👏👏....never thought that I would found algorithms that much easy....thank u so much sir
i have seen all the courses of you sir ..Added a huge knowledge to me
mind blowing way of explaining time and space complexity! must watch for all developers!! I'm SO glad I found this channel! Thank you so much for sharing your knowledge
Hello, Could you help me please ?, at 10:46 the teacher said the f(n) eqauls 2n^3+3n^2+2n+1 about the part (2n+1) it shouldn't be (3n+1) ...?! because there is clearly 3 of (n+1) I can't understand why this happened.
Best Time Complexity tutorial ever!! Thanks a lot. I have been reading the module but couldn't understand. Thanks for this video.
@Abdul Bari, God bless you for making available your know knowledge from far away from wherever you are.
You have no idea how your tutorials are elevating my algorithm concepts to a CS undergraduate level. Once again, thank you.