Learn Big O Notation In 12 Minutes

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:

#Algorithms #WDS #BigONotation

[chovbee]

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!

[threeone]

This is the best programming channel on YouTube.

[fredianriko]

what about O(log n) how would you explain it? and what the example of the algorithm that represent O (log n) ?

[rohitkudalkar]

I was waiting for all your data structure and algorithms videos and here start one. Love and support and care ❤️

[RoshanKrSoni]

That's why I clicked bell icon.
Coz only you know what we need.
Thanks Kyle for making this 😍
You are Superman.

[boss_man]

Just taught me in 12 minutes what I’ve been stressing over for 2 days. Fair enough.

[imma]

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.

[glinspire]

This is the best and simplest video I ever found about Bio O Notation. Thank you man

[dev_casper]

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.

[knoiohi]

Thank you! Web dev simplified has been my teacher since html and CSS! I'm now studying intermediate javascript and CS50 and he's still the guy that is helping me undwrstand everything ❤

[sanjitselvan]

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!

[kvnptl]

Thanks a lot for the demonstration of Big-O with coding examples. Now, it is super clear to me.

[akn]

That's our vintage Kyle doing what he does best, Awesome Videos of JavaScript & other cool stuffs like this !

[wepranaga]

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.

[itsReshad]

This is the best explanation I have ever come across for learning Big O Notation! Keep the great content coming!

[sophielyon]

man...my mouth literally dropped when you explained the part I NEVER understood about this in a way I finally can understand...

[richardvargas]

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

[ayai]

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<n;I++)1
For(int I=0; I<n;I++)2
{cout<<I;3
P = p + I;4
}
In my uni the frequency count of the 1st line is n+1,
I don’t understand where the +1 is coming from.
And for 2nd line is n(n+1) why is it not (n+1)(n+1) because it is the exact the same for loop,
Line 3&4 are n*n which I understand
They are not just the product of the second loop but also the product of the first loop hence n*n if I’m not mistaken.
So my confusion is basically where the +1 is coming from And why is the frequency count of the second loop n(n+1)
Any help would be appreciated it.

[basictoadvance]

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

[mrnfmwu]

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!