Big O in 2 Minutes

Big O notation is one of the most important algorithmic topics for coding interviews. Today we'll be understanding it in just 2 minutes.

🔗 Resources

🎵 Music
Music Courtesy of Epidemic Sounds
Tea Tree - Jobii
Pick Up Your Phone Please - baegel

#coding #softwareengineer #bigo

[yuqingpeng]

I have learnt Python for a couple of months now, and I have always seen Big-O notation many times but never really knew what it was. Your explanation was very clear and now I understand. Keep up the amazing work. This channel definitely deserves more support.

[voegel]

To be honest, I am at this point not even a freshman at university. But you explain and describe the topics you picked so well that I can understand them (obviously not thoroughly but with a good overview). These 3 minuted are amazingly worth it. And - because we‘re talking about algorithms - I cannot understand how the YouTube algorithm doesn’t highlight you. Well, that’s proof enough: Google must improve.
Have a nice day!
Julian

[OverlordOfNerds]

I only knew the name 'Big-O' and had no idea what it was about. Now I understand what it means at least. Thanks for the explanation! Was so clear and understandable.

[myst.youtube]

This is the best explanation for Big O and how important it is.

[itzDJ]

Great video! Just found your channel and subbed

[mokho]

love your videos and visuals. keep it up

[HusamOdat-qqii]

Awesome channel with incredible content .. keep going

[shirazkamran]

Beautiful! You gained a new subscriber and hopefully a new student eagerly waiting for new videos.

[rosek]

Small note: sometimes O(n) refers to the size of the input (in bytes, for example), but sometimes it refers to how large the input number is. For example, the complexity of finding the nth fibbonacci number via a simple iterative loop storing the previous two numbers (pseudo code:
let mut prevprev, mut prev = 1, 1;
for i in [2..n) {
let x = prev + prevprev;
prevprev = prev;
prev = x;
}), is usually referred to as O(n) but it's O(n) in the value of the input, not its size. It grows much more rapidly with the size.

[iamthesrm]

I am one of your viewer from 1K subscription! Congratulations 🎉
Keep up the good work brother 🥰

[MrRe-sjiv]

Thank you so much for such a helpful information.

[levydorgival]

There's a parenthesis mismatch in your thumbnail, maybe "O(n(log(n))" was not intended.

[secretnobody]

Please explain then, why not use the best O(logn) always as its the best right?.

[chamarr]

great vid! where is the best place to learn DS and algo for absolute beginners, and what is the best strategy to learn and retain that info?

[josephjoshi-mr]

Nice presentation but why that background music?

[JustaSimpleComplexSyrian]

wtf is this tho? is this university level or highschool stuff?