Do you want to learn python from me with a lot of interactive quizzes, and exercises? Here is my project-based python learning course: codebasics.io/courses/python-for-beginner-and-intermediate-learners
I watch your videos because they're easy and resourceful but this video is too fast.please make another video on time complexity and please make it very beginer friendly
very nicely explained, one major problem youtube tutorials have is they have this assumption that we already know the basic things so they skip over those parts, even the really important ones, but you explained it right from the base and still managed to keep it short, thank you
Thanks Vikas for the comment. I am just trying to build the society where people help each other. Spread the knowledge, be the real and life is all set. 😀
You are doing great. I look up to you. You try to make us feel what is under the hood, in an intuitive manner. I wish there was more teachers like you.
i am teaching coding to myself, and soon realise that without knowledge of algo and datastructure its DOA...read many books, understood the basics...but this video is byfar the BEST explanation i have come across...only possible if the tutor understands it well rather than copying from any text book..thank you
9:46 It took me a while to wrap my head around how exactly he derived the order to be O(log n). Consider the example he provided: an array of eight digits with the 7th digit being our target value. Using binary search, this example is actually a worst case scenario. Why? Well because we had to go all the way to the 3rd iteration, where we are at an array size of n/(2^3). Basically, since n=8 in this example, we have 8/(2^3) = 8/8 = 1. So we see that the worst case scenario is when n/(2^k) = 1. Each iteration is cutting the array size in half. The worst case scenario is where we keep having to cut the array size down until it goes from being length n (originally) all the way to 1.
I just learn this on my 27th age! What is log what is log2.. haha.. I was sleeping on my maths classes :D What is the main comedy in this?? I have a post-graduation in computer science !!!! :D :D :D
I have to admit it whatever you teach it sound's very easy. Be it right from the git basics, Data Science and now DS & Algos. Such a wonderful teacher you are. I normally don't comment unless i really like the content but the way you teach and the content you put is on point, crisp and very understandable for a complete novice like me. Thank you so much again. I wish to see this channel hit more than 500K soon. More power to you :)
I am eagerly waiting for data structure with python and fortunately I found this. It is heartiest request to complete this playlist..I will be very thankful.
I am so fortunate to be a learner of this channel,i extol the way you explain the complex things in such a intuitive way.You are really patrician, so generous and erudite Mentor i ever seen.Keeping uploading such stuff sir regarding Data Structure and algorithm.
@@codebasics Trust me Sir, I was not expecting a comment back since the video was 1 year old. This shows your dedication for your students cum subscribers. 🙏
Thank you so much for your explanation. I was struggling a lot for this big O notation in my uni class. your explanation is really clear and give me a fully understanding.
Hey! Your explanation was great! But can you provide more examples of how to calculate the time complexities and the increasing order of time complexities?
I am literally having a Bruh moment with me....I was searching some videos on this topic and every vide were like 40-50 minutes long with 2-3 parts...but you literally explained it under 15 minutes in very efficient way...Thankyou soo much for the video ☺
Thank you so much sir. after watching your video, every topic seems like a piece of cake and the best part of your teaching style is that you explain every thing. I have seen many video, but most of them just says that binary search time complexity in logn but nobody explained it like you. Thank you sir
Bachmann and Landau, the original inventors of the big O notation, never said O(n² + n) was wrong, but anything O(n² + n) is also O(n²), so it is customary in practice to prefer O(n²).
9:19 -> you messed up here. up to that point, it was all going fine... (n/2**k) is not the number of operations. it is the number of remaining items. the number of operations/iterations is "k". but it is still a thumbs up. cheers.
Could you please make data structure videos for non programming and non math background students as well because few times it is quite difficult to follow your terminology and explanation.
I have an interview Monday and I am glad I found this great resource today! Thanks so much! You just earned a subscriber and I will let my friends also know about your channel.
thanks a lot sir for helping me with this i am a high schooler big i still understood it cause of your crystal clear explanation that even coursera was not offering
to get the square of any number you can also write this code def square(number): result = number ** 2 return result result = square(5) print("The square is:", result)
In 20 years of programming, I have never needed this in practice. Just recognizing nested loops is often enough. In practice you always need to find if it is acceptable, because often it is not an issue! and if it is, then simply iterate. When interview questions are about this, then I know it is not a experienced developer. We can see that in this in this video as well: using range(len(numbers)), and iterate by index is not something a python developer should do. ever.
Thank you so much for wonderful video about Big O Notation and I am searching for long time,Finally I got correct guidance about this. Thank you Once again
Sir, your python training classes which is launched last month is more than amazing, thanks for your great efforts. Just asking, can I get a tutorial series on data structures for C language.
Do you want to learn python from me with a lot of interactive quizzes, and exercises? Here is my project-based python learning course: codebasics.io/courses/python-for-beginner-and-intermediate-learners
Hyy can i be a software engineer by coding in python, and learning frontend languages like html, css, javascript.
I watch your videos because they're easy and resourceful but this video is too fast.please make another video on time complexity and please make it very beginer friendly
there is no other teacher who teaches Data science and Data structure simultaneously . (Great sir once again thank you from bottom of my heart)
Glad you liked it Mohit.
Your appreciation is our inspiration
@@codebasics plz make more videos on data structure and algo
@@codebasics and also post daily one coding interview solved questions
learnt so much more in a 12 min video than my 6 months semester at university...Thank you sir.
😂😂🙌
really same here, I first time I understand clearly
bet...You are from Pakistan.
@@chesswithmoiz IDIOTTT
totally agree......200%
very nicely explained, one major problem youtube tutorials have is they have this assumption that we already know the basic things so they skip over those parts, even the really important ones, but you explained it right from the base and still managed to keep it short, thank you
Not all heros wear capes.. You're one of them... May the force be with you....
Thanks Vikas for the comment. I am just trying to build the society where people help each other. Spread the knowledge, be the real and life is all set. 😀
@@codebasics Kudos🙏🙏
I don’t know how these explanations could be done better. Just amazingly beautiful, boss. You have written and recited poetry of coding.
I am happy this was helpful to you.
i just got an eye opener video on Big O notations, I tried learning from many sources but the clarity here is just amazing.
You are doing great. I look up to you. You try to make us feel what is under the hood, in an intuitive manner. I wish there was more teachers like you.
Please, could you add captions for deaf people 😊 it's a simple button 😉
All the best my brother 🤍
Maine 20 se 30 video dekha hay time complexity ke upar par itna simply or example ke sath koy nehi samjhaya.....❤️❤️
StatQuest, 3brown1Blue, and this channel become my survival kits as a software engineer
i am teaching coding to myself, and soon realise that without knowledge of algo and datastructure its DOA...read many books, understood the basics...but this video is byfar the BEST explanation i have come across...only possible if the tutor understands it well rather than copying from any text book..thank you
9:46 It took me a while to wrap my head around how exactly he derived the order to be O(log n).
Consider the example he provided: an array of eight digits with the 7th digit being our target value. Using binary search, this example is actually a worst case scenario. Why? Well because we had to go all the way to the 3rd iteration, where we are at an array size of n/(2^3). Basically, since n=8 in this example, we have 8/(2^3) = 8/8 = 1. So we see that the worst case scenario is when n/(2^k) = 1.
Each iteration is cutting the array size in half. The worst case scenario is where we keep having to cut the array size down until it goes from being length n (originally) all the way to 1.
Thank you!!!
Thanks a lot .
@@vedantkulkarni5437 Interesting point!
Thanks mate,that came of help!
Fantastic job! No intro no waste of time just some Quality Content, Great Work!
Glad you liked it!
I appreciate the detail and simplicity you bring to this lesson. You are great teacher, Sir. Many thanks.
I just learn this on my 27th age! What is log what is log2.. haha.. I was sleeping on my maths classes :D What is the main comedy in this?? I have a post-graduation in computer science !!!! :D :D :D
I have to admit it whatever you teach it sound's very easy. Be it right from the git basics, Data Science and now DS & Algos. Such a wonderful teacher you are. I normally don't comment unless i really like the content but the way you teach and the content you put is on point, crisp and very understandable for a complete novice like me. Thank you so much again. I wish to see this channel hit more than 500K soon. More power to you :)
Thanks madu, glad to see your comment and kind words of appreciation first thing in a day. 😊👍
I am eagerly waiting for data structure with python and fortunately I found this. It is heartiest request to complete this playlist..I will be very thankful.
Dear Satyaprakash, I am trying to cover almost all the topics. Don’t worry, you will get the enough content through codebasics. 😀
@@codebasics thank you sir
I am so fortunate to be a learner of this channel,i extol the way you explain the complex things in such a intuitive way.You are really patrician, so generous and erudite Mentor i ever seen.Keeping uploading such stuff sir regarding Data Structure and algorithm.
Thank you for explaining this complex topic in just 12 mins. You are really a Master !!!
Glad it was helpful!
Your explanations are so simple and interesting, thanks for this !
Glad you like them!
But for a higher classes
@@ajmalbangash6928 i am at 5
Very clear explanations!.. I missed giving full attention to math class during my engineering!!!..
Thank yo so much Guru ji!!
Before seeing this video, my confidence is none.. but after seeing this, i have a liitle bit of confidence!! Great teaching sir
All the best
after watching a lot of videos related to DS ,I got this and now I can say that this is the best till now.....thank you
Love the way you explained the time complexity with the ease. Highly Appreciate it, thank you Sir!
I am happy this was helpful to you.
@@codebasics Trust me Sir, I was not expecting a comment back since the video was 1 year old. This shows your dedication for your students cum subscribers. 🙏
woww sir auper awaited series gotta be a biggest hit abi tak data science ko rakh kar k kisi ne ds and algo nai banaya h you tube p
Yes Apoorv, that’s why I decided to start DS. Knowledge of DS is indeed very essential.
Thank you so much for your explanation. I was struggling a lot for this big O notation in my uni class. your explanation is really clear and give me a fully understanding.
Hey! Your explanation was great! But can you provide more examples of how to calculate the time complexities and the increasing order of time complexities?
I am literally having a Bruh moment with me....I was searching some videos on this topic and every vide were like 40-50 minutes long with 2-3 parts...but you literally explained it under 15 minutes in very efficient way...Thankyou soo much for the video ☺
Thank you so much sir. after watching your video, every topic seems like a piece of cake and the best part of your teaching style is that you explain every thing. I have seen many video, but most of them just says that binary search time complexity in logn but nobody explained it like you. Thank you sir
I am happy this was helpful to you.
Better than university teachers!
Please post more videos as fast as possible.... 😃
👍 sure Varun
Best Big O explaination I have ever heard.
Great job thanks
Glad it was helpful!
Thankfully i tried this vdo... It's perfect for me to learn as a newbie. Thanks!
Glad it was helpful!
Bachmann and Landau, the original inventors of the big O notation, never said O(n² + n) was wrong, but anything O(n² + n) is also O(n²), so it is customary in practice to prefer O(n²).
Excellent explanation Sir . I love the way you taught in the most simple manner.
the best explanation i've seen by far
what can i say instead of saying thank you ..so much respect for you sir.
Finally, got clarity… Thank you
Clear and nice ,easy to understand .
Thank you, I think I might have understood it now. You might have saved my school task.
The world needed this video, ty bro
😊👍
Thanks a lot for the video! I never seen such a clear explanation for 'log n'
Very nicely described, referred many blogs before this nothing is close to this.
9:19 -> you messed up here. up to that point, it was all going fine... (n/2**k) is not the number of operations. it is the number of remaining items. the number of operations/iterations is "k". but it is still a thumbs up. cheers.
Could you please make data structure videos for non programming and non math background students as well because few times it is quite difficult to follow your terminology and explanation.
Great video, one assumption is the list has to be sorted in ascending order before applying the binary search. Thans
You explained so simply. Great Work
Glad you liked it
sir what can say you are just awesome i am learning everything from your channel DS ML and Data structures... Thank you so much
Mathematical explanation is superb
for i in range(len(numbers)):
for j in range(i+1, len(numbers)):
if numbers[i] == numbers[j]:
print( f"{numbers[i]} is a duplicate")
break
Best explanation ever. I understand it immediately
You explain stuff very simply - new sub.
Hats of to you for explaining in such detail
Hi Sir,Your Explanation is crystal clear.No More Questions
I have an interview Monday and I am glad I found this great resource today! Thanks so much! You just earned a subscriber and I will let my friends also know about your channel.
Wish you all the best for your interview mark 👍
@@codebasics Thank you so much!
very well explained
Nice explanations to understand data structures!!!
It is a wonderful video explained so well 👍
Excellent teacher! Am going to watch all of your data structure videos
thanks a lot sir for helping me with this i am a high schooler big i still understood it cause of your crystal clear explanation that even coursera was not offering
Glad you enjoyed it
Very good approach thanks for sharing
Very Nice Lecturer about Big O Notation 👌. My College Professors needs to learn From You sir. Myself Dev Patel , You are Also Patel I know
🤗🙏 dhanyavad dev, comment karva mate 🤓
to get the square of any number you can also write this code
def square(number):
result = number ** 2
return result
result = square(5)
print("The square is:", result)
the best chanel I have ever encountered , you are the best . 💜💜💜
Great sir thank you from bottom of my heart✌✌
Most welcome
Thank you Dhaval , very nice explained!. I understand more in your videos than when I was at university :)
I am happy this was helpful to you.
Really Bottom of my Heart, Appreciating Your Work..You make things Easier
Glad to hear that
Clear and simple 👍🏻
Giving example with each condition is helpful to know how and where to use which data structure ... appreciable sir thanks n waiting for more videos 😊
You're most welcome
Thanks a whole lot, but please add “space complexity” in your title for others to know you gave a touch on that
In 20 years of programming, I have never needed this in practice.
Just recognizing nested loops is often enough. In practice you always need to find if it is acceptable, because often it is not an issue! and if it is, then simply iterate. When interview questions are about this, then I know it is not a experienced developer. We can see that in this in this video as well:
using range(len(numbers)), and iterate by index is not something a python developer should do. ever.
You're right, I don't get it
very nice explanation.......learned it clearly
Thanks...clear and concise explanation.
The video is great, as many other videos in this channel, although the space complexity explanation was a bit confusing to me.
superb.. crystal clear explanation👍
Beautifully explained 👏👏👏👏
Glad it was helpful!
Very nice tutorial sir. Please continue this good work
Keep watching
Great explanation
You are the best sir
This the video that has help me the most ever
Thanks so much. I really enjoyed this video
Thank you, you're a good teacher!
very good explination
It's truly wonderful explanation 🙏 thank you so much 👍
best explanation 🗽
Thank you for this video sir....
Great tutorials !!
Glad you like them!
Sir, you are best .
Wow! Thank you so much my firiend :) Finally understood the concept well !
Glad you enjoyed it
You teach very nicely 🙂🙂🙏🏼
Glad it was helpful!
Thank you so much for wonderful video about Big O Notation and I am searching for long time,Finally I got correct guidance about this. Thank you Once again
thank you sir for explaining the rules.
Very well explained... Sir one request, please also cover examples on all of these.
Thank you
hey Paras, I actually have example code snippets for each of the code complexities. So not sure which example are you looking for?
Hash table is really good to take up the data
really helpful video
Beautiful.Well-structured and easy to follow)
Glad it was helpful!
thank yo u from somalia you helped me a lot, thank yuo once again I wish you best of guidance in your life
Glad it was helpful!
took a little bit of time to understand but I succeeded (thanks)
Nice vedio
thanks a lot for detailed explanation
Sir, your python training classes which is launched last month is more than amazing, thanks for your great efforts. Just asking, can I get a tutorial series on data structures for C language.