Comparing Algorithms: Big O Notation

[@beardlyinteresting]

I'd always struggled with understanding big O notation, this video was super helpful in bridging the gap in my knowledge. Thanks.

[@4.0.4]

Coming from your Fibonacci video, this one was more my level :) it didn't hurt my brain as badly.

[@ethancharim7321]

I’ve watched the Fibonacci Heap video about five times, and now I properly understand what the big O means. Now if there’s a video on amortized analysis I could maybe fully understand it, lol.

[@RowBear0]

This is great!

[@f.linezkij]

10:08 Since 𝒪(g) is a set of functions and f is an element of it (if the conditions of the definition below are satisfied), formal notation should be f∈𝒪(g) instead of f(n)=𝒪(g(n)), e.g. 7n+6∈𝒪(n). Just if you're another guy who's wondering about what for a mathematical object 𝒪 actually is 😅

[@nottheth0mm5ter]

I wish I would have known you earlier. That’s literally what I needed to learn for my exam T.T But interesting video. Keep up the work

[@ster2600]

You need more subs

[@ChudBogdanoff]

I just struck gold