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
Big O Cheat Sheet: www.bigocheatsheet.com/
🎵 Music
Music Courtesy of Epidemic Sounds
Tea Tree - Jobii
Pick Up Your Phone Please - baegel
#coding #softwareengineer #bigo

[@yuqingpeng6523]

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.

[@Codebagel]

Thanks so much Yuqing! I’ll keep working to create helpful content!

[@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 KZbin algorithm doesn’t highlight you. Well, that’s proof enough: Google must improve. Have a nice day! Julian

[@Codebagel]

Thanks so much Julian! Really makes my day to see that I’ve helped someone! And yes haha, I’m hoping the KZbin algorithm can catch me sometime soon, but for now I’m just glad to be making content that helps a few people :)

[@besherkhayat2190]

Spectacular and clear as usual! ❤️

[@Codebagel]

Thanks so much Besher! I’m glad you’re enjoying the content!

[@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.

[@Codebagel]

Thanks so much! I’m glad I could help!

[@rosek6585]

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.

[@Codebagel]

Awesome comment!!

[@mokho3027]

love your videos and visuals. keep it up

[@myst.youtube]

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

[@helloworldcsofficial]

More of these please! Thanks!

[@MrRe-sj2iv]

Thank you so much for such a helpful information.

[@aninditabatra3810]

best explanation all across youtube!

[@Codebagel]

Thank you! I hope I can continue to help you!

[@HusamOdat-qq6ii]

Awesome channel with incredible content .. keep going

[@manesito19]

Big 🍩 Notation 🔥

[@Codebagel]

Haha love this! Big 🥯 Notation!

[@iamthesrm]

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

[@Codebagel]

Thanks so much!

[@itzDJ73]

Great video! Just found your channel and subbed

[@Codebagel]

Thanks so much DJ!!

[@itzDJ73]

@@Codebagel Of course! I look forward to seeing your channel grow

[@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?

[@Codebagel]

The best place to learn DS and algo for absolute beginners is right here, on this channel! I plan on making videos for every single data structure and algorithm, but for now, here’s the plan I would recommend: 1) Watch my video on Top 7 Data Structures, and later this week when it comes out, the video on Top 7 Algorithms 2) For each DS and algo in those videos, Google them in your language of choice. For example, if you code in python and the next item on your list is hashmaps, Google “Hashmaps in python”. You’ll find a ton of resources here. 3) Once you’ve gone over all the DS and algos, start practicing LeetCode. I recommend checking out NeetCode.com for a list to start with. If you can’t come up with a solution, don’t worry! Look at the answer, take time to understand it, and then move on. You’ll get better over time. You just gave me an idea to make a video about a full DS and Algo plan for beginners. I’ll get that out by next week. Hope this helped, please let me know if I can help at all!

[@D4rkJvck]

The last song title please...

[@levydorgival9883]

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

[@Codebagel]

Thanks for bringing this to my attention. It has been fixed!

[@dylaneveryday365]

👌

[@Codebagel]

👌

[@shirazkamran1021]

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

[@islaminjass6898]

W

[@Codebagel]

W

[@JustaSimpleComplexSyrian]

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

[@Codebagel]

This is typically university level stuff, although it’s a very important topic for interviews that often goes under-taught

[@JustaSimpleComplexSyrian]

@@Codebagel Good cuz iv never heard of it, I will be in university next year, I thought I was stupid, thank you for replying.

[@Codebagel]

@@JustaSimpleComplexSyrian no worries! And hey, if you’re just going into university and you know anything at all, you’re miles ahead of most people. Don’t get too worried if there’s a few things you haven’t learned yet, you have the next few years of your life to get it all!

[@JustaSimpleComplexSyrian]

@@Codebagel Thank you, I really appreciate the motivation.

[@Codebagel]

@@JustaSimpleComplexSyrian No worries. It’s good that you’re on it this early. If you’re able to stay ahead of things in year 1, you’ll be set for internships in years 2 and 3, and this opens the door to working at any company you want. Sky’s the limit, just keep working hard, and remember to take time and enjoy life :)