Must-Know JavaScript Algorithms for Beginners || Big O Notation

Рет қаралды 4,289

3 жыл бұрын

If you want to become a developer, then you need to be able to come up with solutions to problems. In this series I teach the algorithms that you'll be expected to know. This video introduces Big O notation in JavaScript. Big O Notation is a crucial topic to understand to ensure that you don't write an inefficient function at the wrong time!
I also wrote a super in-depth Big O article where everything is explained so anyone can follow along: www.doabledanny.com/big-o-not...
Subscribe to my channel: / @doabledanny
Follow me on twitter: / doabledanny

Пікірлер: 20

@CodingJourney20 8 ай бұрын

Very nice, thank you ✅

@nancyalday296 2 жыл бұрын

Thanks for your very clear explanation!

@Anders.B. 3 жыл бұрын

Yes, thank you for making it visual! I've heard about Big O from podcasts and I knew the big picture of if, but it was very helpful to see some examples of it.

@doabledanny 3 жыл бұрын

Thanks Anders! So glad it was of good use to you :)

@dominicdoyle2895 2 жыл бұрын

Excellent explanation. Thank you sir

@doabledanny 2 жыл бұрын

You're welcome :)

@mazadesigndev295 3 жыл бұрын

Very simple, clear on explanation and helpful. I have learned the Big O before, however, this has ticked the box for me as the examples have made a big difference when it comes to understanding the concepts. Thank you for explaining this and keep it up :)

@doabledanny 3 жыл бұрын

Wow, thanks for the kind words Madalena! So glad you found it helpful :)

@svejdam7106 3 жыл бұрын

Awesome bro! Nice explanation :)

@doabledanny 3 жыл бұрын

Thanks Martin!!

@josue-cedeno 3 жыл бұрын

This is a great explanation of Big O. I would really like to watch you explain the others.

@doabledanny 3 жыл бұрын

Thanks Josue! Do you mean you'd like me explain the logarithmic big Os? I'd be happy to try to if so :)

@josue-cedeno 3 жыл бұрын

@@doabledanny yes, that would be so helpful!

@doabledanny 3 жыл бұрын

@@josue-cedeno Cool, I'll see what I can do!

@GaneshH 3 жыл бұрын

Great Explanation of probably the most important concept in Algorithm Design! The array manipulation example is really nice :)

@doabledanny 3 жыл бұрын

Thanks Ganesh mate! I'm surprised it's not covered on freeCodeCamp tbh, such an important concept to understand!

@kanavsethi5726 3 жыл бұрын

Interesting.... Though amazing video!

@doabledanny 3 жыл бұрын

Thank you Kanav!

@geraldthomas1364 Жыл бұрын

3:20 I don't understand how the time complexity here is 2n. If you're iterating through the input array once obviously that's linear dependent on the size of the input arr but to get to 2n I'm assuming you're implying there's another linear operation that was added to make it 2n but I don't see it. The other operation is pushing each value into the array called "newArr." But since each insertion is at the end of the array thus we don't have to worry about changing any of the indexes that were already in it, doesn't that make pushing into that array just 0(1) time complexity so it would make that algorithm 0(1) + O(n) which becomes O(n)? This question probably doesn't matter because I see how we both got to O(n) but since I'm learning I just want to make sure I got the process correct

@doabledanny Жыл бұрын

Looping over the array will be n loops. Then, within that loop, we are pushing a value onto a new array; this will happen n times because it is within the loop. So n +n = 2n