Big-O Notation in 3 Minutes

Animation tools: Adobe Illustrator and After Effects.

Checkout our bestselling System Design Interview books:

ABOUT US:
Covering topics and trends in large-scale system design, from the authors of the best-selling System Design Interview series.

[peterhung]

This video is the most valuable 3 minutes I had this week.

[funkykong]

That was an amazing explanation and the visualizations were perfect. Thank you!

[wasimxcode]

No one makes visual likes you. How things are work ❤

[juanmacias]

Thank you for the awesome explainer, and the added context needed for real world computing at the end.

[gergelyfarago]

Thank you, great video! Quick remark: at 2:17 image should be cache-*un*friendly for column-by-column traversial.

[TheBenito]

What a sense of clarity and synthesis ... Bravo!

[Biometrics]

Thank you! This is simple and easy to visualize.

[andreigabe]

You help me alot, Thankyou for giving this kinds of video.

[bananesalee]

whoa already a million sub ! congrats man, youtube does reward the good creators

[renatobrakarz]

First! From Brazil, in 25 seconds!

Primeiro! Do Brasil, em 25 segundos!

[kilosierraalpha]

That was awesome! Thank you. BTW, does anyone know how these awesome animations are done? I'm always in awe. Would love to learn how to do them myself for presentations.

[crazywill]

So I think one limitation to this is that column order vs row order matrices is language implementation dependent. Fortran vs C is an excellent example. And then you have languages like C# where is uses something completely different.

[croosed]

quicksort is NOT O(n log n), because O-notation looks at worst-case scenarios (i. e. "bad" pivot).
on average however it will turn out to be in n log n...

[marsim]

please make a video about how you make your wonderful animated infographics pleeeeaasse 🙂

[javastream]

Naive matrix multiplication is NOT in O(n^3). It's in O(m^1.5) because the input size is in O(n^2). 👉Decades of panic have been made!

[sanjaynaik]

how to make interactive digrams like you?

[javastream]

‼A CPU cache does NOT change the Big-O!

Only the "cache" in your algorithm, which avoids re-computation.

[gowthamsrsk]

I didn't understand anything, so what can i do?
Would anyone be able to guide me?

[MomchilAtanasovHome]

Except that Big O represents all functions that progress slower than the one passed into the O.
It will thus be correct to say that bubble sort is O(n^2) or O(n^3) or even O(n!). All are valid.
There are other qualifiers like theta or little o that can be much more restrictive and sometimes more descriptive.