Learn Big O Notation In 12 Minutes
Vložit
- čas přidán 20. 06. 2024
- Big O Notation is one of the more confusing computer science topics since it is not very intuitive. It also is one of the most important computer science topics for passing a technical interview, which makes it a very valuable skill to learn. In this video I am going to breakdown big O notation in easy to understand terms and example so that you never need to struggle with big O notation again.
🧠 Concepts Covered:
- What big O notation is
- How to calculate big O notation
- The importance of big O notation
🌎 Find Me Here:
My Blog: blog.webdevsimplified.com
My Courses: courses.webdevsimplified.com
Patreon: / webdevsimplified
Twitter: / devsimplified
Discord: / discord
GitHub: github.com/WebDevSimplified
CodePen: codepen.io/WebDevSimplified
#Algorithms #WDS #BigONotation
I literally spend hours, looking through various videos to try and learn on new things and I never learn as much as I do from your videos man. I really don't know what is is, but the way you explain and teach, there is a simplicity to it that just makes everything click for me. Your channel has helped me so much throughout college and now its helping me prep for my first big interview, I really can't thank you enough man!
This is the best programming channel on CZcams.
I agree. Simple & straightforward.
facts, my go-to every time
I've been looking for an explanation for this for like an hour now, and this video has by far been the easiest to follow along with and understand. Thank you very much.
When I searched about time and space complexity, I saw some very popular channels videos and yours as well in that list. I clicked yours first cuz I trust your knowledge and your way of explaining things is way easier to grasp. Thanks a ton man!
This is the best explanation I have ever come across for learning Big O Notation! Keep the great content coming!
Thanks a lot for the demonstration of Big-O with coding examples. Now, it is super clear to me.
what about O(log n) how would you explain it? and what the example of the algorithm that represent O (log n) ?
This was probably the simplest explanation of this topic.
Thank you!!!
Thanks kyle. Big(O) notation is something I have always got confused from multiple sources. This video is really helped me to understand with simple examples.
This is AWESOME, would love to see more of these , thanks a lot for this video
This is how you explain concepts like these. Highly appreciate your effort.
This is the best and simplest video I ever found about Bio O Notation. Thank you man
Thanks Kyle, very nicely explained, always had problems understanding the O notation
your video's help me lot usually I never preferred to watch video's for learning but when I started watching your video its really easy and understandable for me. Your content is very simple and short and understandable
Thanks for making this
Amazingly clear explanation as usual! Till now I only had a surface level understanding of Big O notation but now I feel much more confident about it, thanks to you! A perfect video to brush up on basics 😊
PS: hope your arm wasn't too sore holding up the letters for 3 mins straight! 😜
Great course ... took my ds and algorithms course about 2 years ago now great refresher!
Oh man, thank you very much! I was trying to learn alone, but some books about algorithms and data structure think that you have Big O notation previously, and many explanations that I found were so complex.
I was waiting for all your data structure and algorithms videos and here start one. Love and support and care ❤️
I have another data structure video releasing soon as well.
@@WebDevSimplified will be waiting Kyle
@@WebDevSimplified please make a series of Data Structure and how to use in a project
Which language is best for learning, data structures and algorithms.
I'm very good at javascript. & very familiar with java & c.
Please somebody HELP ME. as I have to continue with js or java or c.
@@sandeepreddy6247 if you make project in javascript and apply data structure on it then start with it
That's why I clicked bell icon.
Coz only you know what we need.
Thanks Kyle for making this 😍
You are Superman.
I legit don't use the bell icon for anyone because fuck getting youtube notifications. Except this channel.
@@chris94kennedy i know & never click anyone's bell icon. But this guy deserve it. His contents made me to do this.
Flawless explanation, thanks Kyle!
Great job, Kyle. Awesome video.
awesome explanation! really appreciate the simplicity of it.
That's our vintage Kyle doing what he does best, Awesome Videos of JavaScript & other cool stuffs like this !
I'm a graduate student in statistics self learning data structures and algorithms. This is a great example. I'll note that it's also very intuitive from calculus. For any self learners without a STEM background I feel a business calculus textbook (without trigonometry) might be helpful to quickly understand limits
Great video man, really helpful
Thanks for the video, made Big O notation very simple and clear.
Very well explained for basic usage.
Thank you for this! Very big help :)
Thanks for such a great explanation!
Great explanation, thank you.
you explained so well. thank you
Awesome explanation! Thanks, man
Hey Kyle! I love your videos and thanks to you, many complicated concepts are now crystal clear. A big thank you for these videos!
PS - Can you please make a video about service workers?
Thanks for this simple and effective explanation, I always stucked at these, But now i think its sorted😄
Now that I think about it, as someone who does have a job, and have interviewed people before
these kinds of question are not meant to be passed. at all, they're just a good excuse to have the liberty to pick which people you might like
although there's gonna be exception to those who pass. that's a a different story.
sure there's interviews that are sometimes have good intention, that's different too.
not all companies are the same though, for some companies. these kind of question can be more of a necessity rather than a luxury
but as more and more companies conducting these kinds of interview questions. they're become more of an excuse.
not to mention if the person asking the questions even knows what they're talking about in terms of these nuance points, not just comparing them to textbook answers
sometimes if not a lot the interviewee are as clueless when it comes to these questions and just treating them as basic checkmark.
awesome videos btw, I always enjoy your content.
Indeed , in web-dev, where things change every 2-3 years, you dont need any of that computer science maths to execute the demands of your boss/client for his web page or app. In fact, technical question in interviews are meant to see how you would handle talking about technical stuff in group settings were they to hire you : Are you a snob intellectual who likes to flash his technical knowledge in an unpleasant way to other coworkers who are not that nerdy? Hiring people is about good chemistry and personalities! Interviewers are looking for people who will fit with the team's member personalities without big ego clashes!! Conclusion: Dont try too hard to impress you're not impressing anyone just be yourself and be honest about how you'd go about tacking a problem while being positive and joyfull: Boom ! You got the job!
That's not entirely true. It depends on the position of the job. If I'm hiring for a senior developer or an architect, I expect them to know these questions as it's important they can create solutions that are performant and efficient, whether they implement it or not.
this is so well done !
man...my mouth literally dropped when you explained the part I NEVER understood about this in a way I finally can understand...
I have see some of the time ( log ) in big O but didn't find on your video, but your explanation was great hope you also explain ( log ) in future.
Hey man, just to let you know that I love what you are doing. You are great teacher. Cheers 🥂
that was really helpful and handy, thanks a lot for making such video, it was easy enough and understood it one shot
you are so good in explaining ...Can you make full playlist on course (data structure and algorithm) with code , because I think its more important to a computer science student (2)
Wow, you have explained it so simply. Subscribed to your channel after watching this video
Kyle you’re a legend
Thank you very good video, it is included as supplementary resource in my software engineering course.
Ur just rocking ...dude...learnt alot from ur videos !...just need some videos on...spring frame work 😃
i took 100 days but i did not understood how to learn big O but now i have learn it beacuse i found your vedio thanks
Hello Kyle, this video very good. I'm from Brazil and I like your videos very much man. Thanks for videos 😁
You make it so simple. Wonderful!!. I thought Big O has some mathematical formula involved in it. Like the big one.
One mistake I realized in the video is @9:53... You said the code written is constant. But it is actually linear. Although the outputs are constant, the code still has to run through the for loop. Which gives the code a Linear time complexity. Other than that you did a great job explaining this lesson. Thanks!
great job! thank u👍
Great video.. Good work.
You are my frickin hero mate. JavaScript DS&A is like the bane of my existence. pls halp.
I liked it! The big O notation for recursion should have been added though.
i like the way you teach... thanks my friend!
awesome explanation
You truly are amazing!!
Well done, sir.
really helpful thank you
Perfectly explained!!!!!!!!!!!!
You should do some advanced algorithm videos or introduce scaling concepts by using docker
Thanks for sharing
wonderful , thank you
great explanation
This big O made me headache in the DS & intrO tO algOrithms cOurse
... that's capital O notation...
I laughed when you introduced this video by saying "...so you can walk into your next interview...". This does come up in interviews, but it is obviously important to understand time & space complexity of anything you run in a browser. Kyle did a good job of explaining that later on in this video, but I did chuckle when the video started. :)
Thank You, my Friend. You saved me.
Thanks this is good!!
Thanks alot❤
Thanks a lot man.
You're awesome mate.
best channel for programming !
Great video.
I wished you would have been making Videos when i was in College - you are able to explain things that Took me hours to understand so well, quick and precise, It would have saved me so much time!
Nevertheless, I Like watching your Videos even If i think that i know Whats going in just to make sure i keep in touch with different topics and basics :)
[Wake up , See what Brad, Kyle and Ed are upto , Learn , Code , Repeat ] ; for (i=0; i
Insightful
this videos are so good even beginner programmer can understand everything so simple and clean thanks for effort your putting❤️
You are awesome buddy💯💯💯
Amazing!
good job brooo
Excellent
Brother You are a LEGEND
Thanks!
Please make more JavaScript algorithm I'm following you , your videos are so easy to understand,😍
Thank you so much. This is really easy to understand. But how about the log ones
You are the best!
lmao I have an interview tomorrow, thank you!
You are a lifesaver
Nice man !
I came from cs dojo and while watching his video I saw a video of kyle on the right side of my desktop so without any hesitation I jumped into it.
Perfect!
What would be the size of the Lester lopp example if you were using recursions instead?
Would it be the same?
Shalom again.
Very nice!
11:06 jata lol :) (really good teaching btw)
thank you
Thank you for amusing and useful content. I have a question regarding O(n+a) example. Can we say that it's just O(n) since they're both linear?
Yes. Big O drops constants.
Yes you can
Great video mate, but there is something I’m still a bit confused. Bear with me a sec.
This is the code:
For(int I=0; I
Awesome =)
Not convinced with this crash course
Didnt explain the other types of time complexity like O(nlogn), O(logn), O(2^n). Not to mention space complexity is another important concept that should have been touched. Knowing only time complexity alone wont give a guaranteed success as a developer since memory consumption analysis matters as well.
Nice video! Just a quick question, is O(a + b) the same as O(a) + O(b)?
Woah, I did not know Jordi was into computer science?!!