@@swayx3657 some of the best instructional videos I have found have been from someone with an Indian or otherwise hard to understand accent. This has made me better at understanding foreign accents, and thus, I get to enjoy more videos.
I pay about 12k a year for education at San Jose State University. It's sad that I learn more from watching your videos for free than I do at a 4 year college. Thanks for your help, your videos are awesome!
Something I didn't really understand enough while I was studying is that an education is very little to do with what you learn, and more about learning how to learn and interact with people, and certifying that you can learn. A large portion of the stuff you learn will be obsolete within a few years, while learning how to learn and work with other people will serve you for life. Not to undermine the compliment to the poster though, this video, and probably the channel are indeed useful :)
i could cry. the importance of educating someone is to keep it simple. my prof wrapped this simple explanation in a 217 pages script. Greetings from germany I owe you one
@@genericwhitemale7028 This is true. We need to explain it repeatedly and with hundred of examples because we don't want to awkwardly stay silent for 3 hours :)
0:40 nice overview 0:50 Big-O usually thinks about worst-case 1:00 Rule 1 - ignore constants 1:15 Rules 2 - certain terms 'dominate' others 1:40 Big-O cheat sheet chart 2:00 Example 1 2:45 Example 2 - for loop 2:58 Example 3 3:30 Quadratic time 3:40 Example 4 - total run time 4:10 Example 5 - if-else statement 4:43 Summary - in practice
It's incorrect to say that Big O usually thinks about the worst case. He did use the word "usually" but did not clear it up. Asymptotic notations are a mathematical concept to generalize the way a function is expressed by writing it in terms of a more general function, doing this makes it easy to compare different functions. Big O is one way to do that. It is used to denote an upper bound to a given function. So it doesn't really have anything to do with the worst case or best case of an algorithm's performance.
It's always hilarious when you spend hours trying to understand something through lecture slides and can't understand it at all, then a 5 minute video explains it better than the professors ever did.
@@jdkingsley6543 more on the system part though i would say, Eduction system from like 200 urs ago when industrial revolution is starting to take place just arent suited for modern society
I've watched a dozen videos on complexity theory, P vs NP and Big-O notation and you are THE FIRST to give examples with a breakdown. Bravo good sir. I doff my cap to you.
After not understanding this topic at my university, I asked the copilot and it referred me to this video. You are a good man Michael. God bless you! You have made it so simple.
THIS WAS PERFECT. I was self-studying from a textbook and was wayyyy to confused, so I did a quick search on youtube and found this video. Easy. Simple. Concise. You covered everything so perfectly and actually helped me understand the topic. THANK YOU SO MUCH. Please continue making videos like this!!!
Instead of the big long videos, you made this concept clear and easy to understand, all TH-cam videos should be like this. I don't know why professors always tends to go very deep very early. Which is absolute not needed for beginner students
If your deegree has anything to do with algorithms i bet you will watch all the videos in his channel. Great work man. Thank you so much. Explanatory and time efficient. Well done!
Couldn't agree more with: No annoying loud music intros, no 6 min introduction, spoken clearly, and straight to the point. I wish all educational videos were like this.
Thank you so much for the explanation! I've been searching all day to find a good video until I'd found yours. Again great explanation, and I love how you got straight to the point.
My algorithms professors spent 1 hour explaining Big-O in the most complicated way possible, and here I learnt about it in just 5 minutes and I actually understood this video way better. Thank you! I wish CS professors would stop this formal complex way of teaching, and try make it simple and easy to learn like this video has done
@@realnice3672 that's a O(1), the cicle doesn't depend on a variable but it will be up to the 10 (11?) cicles that range does. If it was a: i in range(n), that's a O(n)
@0:08: Big o notation is simplied analysis of _____: an algorithm's efficiency. @0:53: Big O typically looks at worst case. Ignores CONSTANTS. 5n ---> O(n)
@1:34: O(1) < O(logn) < O(n) < O(nlogn) < O(n²) < O(2²) < O(n!) @1:41: BigOCheatSheet.com @2:11: O(1)==ConstantTime _____: (size of n does not effect calculation time)
@2:48: N*O(1) == O(N) == LinearTime @3:22: O(1)+O(N) ==> O(N) _____: Because the for loop dominates runtime. _____: For very large values of N, the O(1) _____: part is like a grain of rice in a waterfall.
@3:26: (N*N) == (N²) == Quadratic Time @3:47: Can you determine the total runtime? @4:30: Because we choose WORST CASE senario, _____: we choose O(n²) in this example. @4:55: Constants Matter and be aware of best and average case.
My professor did such a heinous job teaching this subject for my Data Structures course, and yet you taught me what I needed to know in five minutes... Thank you sir.
This explanation literally thought me how to calculate one of the most important features of a good code, its Efficiency. All in 5 minutes. Unbelievable. Thanks, truly!
Wow! I go to Sussex University, Brighton, England, United Kingdom even though I am on exchange from University of Queensland, Queensland, Australia (Top 50 uni) and I still learn so much more than I have in my 50 year degree! Love your vids
Crazy how this guy made me understand Big O notation in 5 minutes. Not to a deep level of course, but enough for me to get a nice intro to understanding time complexities.
At 2:34 we say 3*O(1) = O(1), but then we say N*O(1) = O(N) at 2:53. Am I missing something about N? Is it different than n (the amount of times the print statement will occur)? My understanding is that n would be a constant and n*O(1) = O(1), just like it did for 3*O(1)
I had the exact same question, but 3 is a constant. It'll never change regardless of the data size N, so it's dropped. However, N is a variable and can change with the amount of data, so it's not dropped. That's my understanding.
No annoying loud music intros, no 6 min introduction, spoken clearly, and straight to the point. I wish all educational videos were like this.
no indian accent
@@swayx3657 some of the best instructional videos I have found have been from someone with an Indian or otherwise hard to understand accent. This has made me better at understanding foreign accents, and thus, I get to enjoy more videos.
And no stupid analogies
@@stuiedaman same here, I'm now professional at understanding foreign accents, even tho Chinese and greek are still so hard to get your ears used to.
I love overwatch
I pay about 12k a year for education at San Jose State University. It's sad that I learn more from watching your videos for free than I do at a 4 year college. Thanks for your help, your videos are awesome!
Modern teachers should learn like this dude. Simple, short and easy to understand.
I think it's the same all over the world. Here in Brazil it's the same, I learn more on YT but we need the f****n diploma...
really agree with this opinion
Something I didn't really understand enough while I was studying is that an education is very little to do with what you learn, and more about learning how to learn and interact with people, and certifying that you can learn. A large portion of the stuff you learn will be obsolete within a few years, while learning how to learn and work with other people will serve you for life. Not to undermine the compliment to the poster though, this video, and probably the channel are indeed useful :)
Same from Spain
HOW DID THIS GUY EXPLAIN IN 5 MINS WHAT CONFUSED MY ENTIRE CLASS FOR 2 HOURS? WHAT THE HELL?!!
lmao right?
2 hours? For me its been 10 weeks and it all makes sense now lmao
What is algorithm efficiency? th-cam.com/video/mL3xb8BoCt4/w-d-xo.htmlsi=43RIy36zdpXRxJCd
i could cry. the importance of educating someone is to keep it simple. my prof wrapped this simple explanation in a 217 pages script. Greetings from germany I owe you one
Explained better in 5 min than in the 3 lectures my professor taught on it
He's gotta expand the class long enough so he won't awkwardly stay silent for 100 minutes.
@@genericwhitemale7028 This is true. We need to explain it repeatedly and with hundred of examples because we don't want to awkwardly stay silent for 3 hours :)
Efficiency
hahahahah I thought the same. I was searching articles and videos about this, and this video is perfect. Although it's just an introduction.
😂
0:40 nice overview
0:50 Big-O usually thinks about worst-case
1:00 Rule 1 - ignore constants
1:15 Rules 2 - certain terms 'dominate' others
1:40 Big-O cheat sheet chart
2:00 Example 1
2:45 Example 2 - for loop
2:58 Example 3
3:30 Quadratic time
3:40 Example 4 - total run time
4:10 Example 5 - if-else statement
4:43 Summary - in practice
It's incorrect to say that Big O usually thinks about the worst case. He did use the word "usually" but did not clear it up.
Asymptotic notations are a mathematical concept to generalize the way a function is expressed by writing it in terms of a more general function, doing this makes it easy to compare different functions.
Big O is one way to do that. It is used to denote an upper bound to a given function. So it doesn't really have anything to do with the worst case or best case of an algorithm's performance.
@@pranavnyavanandi9710 Actually it's not exactly that considering we disregard the multiplicative constants wheras in maths we don't
It's always hilarious when you spend hours trying to understand something through lecture slides and can't understand it at all, then a 5 minute video explains it better than the professors ever did.
Yes
literally break out laughing, old educators are the problem.
my data structures and algorithms book literally rambles off on none important information and over complicates this proccess lol
@@jdkingsley6543 more on the system part though i would say, Eduction system from like 200 urs ago when industrial revolution is starting to take place just arent suited for modern society
its because they gotta gatekeep the knowledge broseph
You did a better job explaining in 5 minutes than my professor did in 4 hours of lecture.
Well done.
Every computer science professor I've ever had didn't explain this concept as simply and concisely as you just did. Thank you.
I've watched a dozen videos on complexity theory, P vs NP and Big-O notation and you are THE FIRST to give examples with a breakdown. Bravo good sir. I doff my cap to you.
I need to do a big-O analysis on my life habits priorities.
Me too
After not understanding this topic at my university, I asked the copilot and it referred me to this video. You are a good man Michael. God bless you! You have made it so simple.
wow that's pretty dang cool. thanks for sharing 💪🏼
THIS WAS PERFECT. I was self-studying from a textbook and was wayyyy to confused, so I did a quick search on youtube and found this video. Easy. Simple. Concise. You covered everything so perfectly and actually helped me understand the topic. THANK YOU SO MUCH. Please continue making videos like this!!!
I don't know who you are, never heard of you before. What I know for sure is that you're a legend and a hero to all students out there
God bless
After 1 hour videos, I cannot believe how much this helped me finally understand this topic. I'm in awe.
love to hear it!
Thank you, this was really helpful. You cut straight to the case and explained everything like a pro. Pure joy to watch.
I think this is one of the best videos I have seen. I hate how most videos won't just bother to show with an actual function or dummy code.
Instead of the big long videos, you made this concept clear and easy to understand, all TH-cam videos should be like this. I don't know why professors always tends to go very deep very early. Which is absolute not needed for beginner students
If your deegree has anything to do with algorithms i bet you will watch all the videos in his channel. Great work man. Thank you so much. Explanatory and time efficient. Well done!
Couldn't agree more with: No annoying loud music intros, no 6 min introduction, spoken clearly, and straight to the point. I wish all educational videos were like this.
Thank you, Vladimir!
You're amazing bro , i have learnt a lot from your five minute video than 36 minutes tutorials.
Slow, loud and clear voice...bro you just saved my exam...thanks
Helped me understand a topic i've been struggling with for ages in a clear and simple way. lifesaver!
Great to hear!
Your explenation is so much better than the explenation from my teachers. Thank you so much!
Thank you so much for the explanation! I've been searching all day to find a good video until I'd found yours. Again great explanation, and I love how you got straight to the point.
What is algorithm efficiency? th-cam.com/video/mL3xb8BoCt4/w-d-xo.htmlsi=43RIy36zdpXRxJCd
This helped me so much in my IB exam prep thanks a lot!
Finally, someone who explains it clearly, without all the mumbo jumbo. Thank you!
What is algorithm efficiency? th-cam.com/video/mL3xb8BoCt4/w-d-xo.htmlsi=43RIy36zdpXRxJCd
My algorithms professors spent 1 hour explaining Big-O in the most complicated way possible, and here I learnt about it in just 5 minutes and I actually understood this video way better. Thank you! I wish CS professors would stop this formal complex way of teaching, and try make it simple and easy to learn like this video has done
one of the Simple and Perfect explanation about Big-O notation I have ever heard.
cant imagine how this could get any easier for comprehension. mindblowingly simple
@@talleyrand9530 if its like a= [i for i in range(10)]
print(a)
isn't that O(N)?
@@realnice3672 that's a O(1), the cicle doesn't depend on a variable but it will be up to the 10 (11?) cicles that range does. If it was a: i in range(n), that's a O(n)
Finally an actually good video which fr explained smth without useless intros and random bs
I was skeptical because this was a 5 minute video, but it explained the concept so well in such a short time. Thank you so much.
What is algorithm efficiency? th-cam.com/video/mL3xb8BoCt4/w-d-xo.htmlsi=43RIy36zdpXRxJCd
Simplified so much that even 8th std kid will understand. Great job.
I read multiple articles about this topic but you are the only one that I can understand. Thanks for the video.
After reading many tutorials on this subject, this is by far the best explanation i have found. Thank you. You just got an additional subscriber
Thank you!
@0:08: Big o notation is simplied analysis of
_____: an algorithm's efficiency.
@0:53:
Big O typically looks at worst case.
Ignores CONSTANTS.
5n ---> O(n)
@1:34:
O(1) < O(logn) < O(n) < O(nlogn) < O(n²) < O(2²) < O(n!)
@1:41: BigOCheatSheet.com
@2:11: O(1)==ConstantTime
_____: (size of n does not effect calculation time)
@2:48: N*O(1) == O(N) == LinearTime
@3:22: O(1)+O(N) ==> O(N)
_____: Because the for loop dominates runtime.
_____: For very large values of N, the O(1)
_____: part is like a grain of rice in a waterfall.
@3:26: (N*N) == (N²) == Quadratic Time
@3:47: Can you determine the total runtime?
@4:30: Because we choose WORST CASE senario,
_____: we choose O(n²) in this example.
@4:55: Constants Matter and
be aware of best and average case.
This is one of the best tutorials I have ever seen, thank you.
Thanks! After a few rewatch and playback, gave me more understanding on what's going on rather than staring at my slides! Kudos to you!
This is so far the best video that I cam across about Big O. Thank you Michael
you may have just saved my life.
My professor did such a heinous job teaching this subject for my Data Structures course, and yet you taught me what I needed to know in five minutes... Thank you sir.
What is algorithm efficiency? th-cam.com/video/mL3xb8BoCt4/w-d-xo.htmlsi=43RIy36zdpXRxJCd
> Uploads short videos that go straight to the point about how algorithms work
> Refuses to elaborate
> Leaves
Michael the big chad
Soooo clear! love it. Much better than our seminar
You are a genius. Thanks for the first time in 6 years I understand this.
Learned more from this 5 minute vid than several hours in discrete structures class...
best channel for cs periodt! Thanks a lot Michael for making me understand this tricky concept which I have been trying to grasp for past one year ;)
💪🏼❤️
Wow, what my professor took hours to explain, you explained better in 5 minutes. I appreciate you sharing this. Subscribed
What is algorithm efficiency? th-cam.com/video/mL3xb8BoCt4/w-d-xo.htmlsi=43RIy36zdpXRxJCd
All the down votes are from jealous CS professors.
No jokes, this man did in 5 minutes what my lecture couldn't do in an entire semester XD
All the down votes are from people who actually know what big-O is.
@@BruceRicard Found one!
After watching so many videos, only this video gave me a clear idea about big O notation.
What is algorithm efficiency? th-cam.com/video/mL3xb8BoCt4/w-d-xo.htmlsi=43RIy36zdpXRxJCd
This is more useful than my professor's 40 minute lecture
bro mine was 90 min...what is the point? 🥲
Thank you so much! You are my saviour. I will finish my algorithms class this semester because of you
💪🏼❤️
I think you explain this better than the author of cracking the code interview. Great job!
I love you dude! 3 lectures worth of nonsense, and this 5 minute video did it for me.
💪🏼❤️
If I have watched these videos three years ago, I would had a better calification at school, thanks a lot
This explanation literally thought me how to calculate one of the most important features of a good code, its Efficiency. All in 5 minutes. Unbelievable. Thanks, truly!
What is algorithm efficiency? th-cam.com/video/mL3xb8BoCt4/w-d-xo.htmlsi=43RIy36zdpXRxJCd
Thank you my friend. My students appreciate all your hard work.
-Mr. U
Awesome to hear. Thanks for sharing my channel!
Better explanation than my teacher with 200 PHDs, thanks!
this video finally cleared this topic for me. After so many materials I read... Much appreciate, keep it up!
Easy to understand and well explained. This really helps. At first glance, My first impression of this topic is quite hard to understand.
Studying for my Data Structures and Analysis of Algorithms midterm, thanks for your help! Great video, very easy to understand explanation.
I failed this class 3 times. I get it. I finally get it. Thank you.
I just started watching but couldn't help myself for thumbing UP, in the middle of it. Great straight to the point explanation!
“Brevity is an art”. Beautiful and simple explanation.
What is algorithm efficiency? th-cam.com/video/mL3xb8BoCt4/w-d-xo.htmlsi=43RIy36zdpXRxJCd
Thanks for this video 👌
Love from India ❤️🇮🇳😍
what the heck, bro is an amazing teacher. I fully understand props to u teacher
Thank you so much. 5 Minutes, simple, easy to understand. No unnecessary jargon.
Dude sums up my first 3 algorithm classes to 5 mins. What a chad :D
OMG! Where were you man? Why our professors are incapable of these skills? God bless you! Thank you
wow! If I only have watched this video before the interview that I have failed 2 weeks ago :D you're a gem!!
Finally someone knows what they’re talking about and explains it well.
Awesome work, champs!
This has got to be the easiest and concise explanation i've ever seen for the Big O notation.
Thanks Champ!!
I could understand easy with your explanation!!
Thanks for your time!
Grettings from Argentina!
Thank you so much for this video. It finally explained what my proffeser couldent. Thank you
I just heard of Big O Notation today and thanks to you for making it digestible.
I love your videos, dude. Simple and short but still educational
This was one fo the best educational videos I have ever seen. Thanks!
Thank you Michael, that was a really concise and great explanation! This video helped me finally wrap my head around these basic concepts!
This is so simple explanation of big-0 I ever found in TH-cam, I was dealing with this. Thanks man.
The best video on big o notation ever!
Thank you bro I needed this i got a test tomorrow and that explained It so well
i learned more here than i did in my cs classes
This is the only video that clicked with on me Big-O Notation.
What an amazing video! Your teaching skills and presentation skills are amazing.
Wow! I go to Sussex University, Brighton, England, United Kingdom even though I am on exchange from University of Queensland, Queensland, Australia (Top 50 uni) and I still learn so much more than I have in my 50 year degree! Love your vids
Now I will be able to prepare lecture for my tomorrow's class. Thank you!
This video finally cleared this topic for me.. thanku so much ..
Your channel saves lives.
Love this simplification of time complexity of Algorithms - thank you, thank you , thank you!!!
You're videos are the best, Thank you for your efforts
I Finally get it!! thank you so much! best explanation of Big Oh
Very neat explanation. Have this topic this semester and this vid made everything click.
Excellent explanation! Easy for understanding...thank you...
Oh man, you saved my Thursday interview, it requires Big-O and I have no idea. If I get the job I will send you a big "thank you!" :)
This is the best explanation i ever come across, thanks!
I can't believe how straight to the point this explanation is, haha
Your content is very much appreciated; your vids are an amazing way for both learning and reviewing algorithms and related theory, thank you!
Crazy how this guy made me understand Big O notation in 5 minutes. Not to a deep level of course, but enough for me to get a nice intro to understanding time complexities.
Not as deep as uni lectures but good for intros or a refresher. Thanks for watching!
At 2:34 we say 3*O(1) = O(1), but then we say N*O(1) = O(N) at 2:53. Am I missing something about N? Is it different than n (the amount of times the print statement will occur)? My understanding is that n would be a constant and n*O(1) = O(1), just like it did for 3*O(1)
I had the exact same question, but 3 is a constant. It'll never change regardless of the data size N, so it's dropped. However, N is a variable and can change with the amount of data, so it's not dropped. That's my understanding.
May god bless you, and your family!