Big-O Notation in 3 Minutes

Рет қаралды 50,449

ByteByteGo

Күн бұрын

Пікірлер: 39

@funkykong9001 2 ай бұрын

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

@peterhung3840 2 ай бұрын

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

@juanmacias5922 2 ай бұрын

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

@TheBenito78 2 ай бұрын

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

@wasimxcode 2 ай бұрын

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

@marc-speaks 2 ай бұрын

Best explainer I have seen

@gergelyfarago8544 2 ай бұрын

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

@SantiagoArizti Ай бұрын

also, the indexes are mixed up there, it still says [i][j] and should say [j][i]

@andreigabe4666 2 ай бұрын

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

@bananesalee7086 2 ай бұрын

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

@Biometrics 2 ай бұрын

Thank you! This is simple and easy to visualize.

@renatobrakarz3499 2 ай бұрын

First! From Brazil, in 25 seconds! Primeiro! Do Brasil, em 25 segundos!

@raj_kundalia Ай бұрын

Thank you for doing this!

@AleksandarT10 2 ай бұрын

great tips!

@RoshiniAjoy 2 ай бұрын

🙏🙏🙏 Thank you

@gedecandra7722 2 ай бұрын

Thank You for sharing this 👍

@kilosierraalpha 2 ай бұрын

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.

@stachowi 2 ай бұрын

fantastic and short.

@VolodymyrMartynov-hi4tj 2 ай бұрын

Thank you so much!

@crazywill32 2 ай бұрын

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.

@IvanSoregashi 2 ай бұрын

Thanks

@marsim4150 2 ай бұрын

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

@croosed 2 ай бұрын

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

@manu-singh 2 ай бұрын

amazingg

@sanjaynaik2325 Ай бұрын

how to make interactive digrams like you?

@OGMadMax 2 ай бұрын

How are these animations made?

@r21d Ай бұрын

Well

@javastream5015 2 ай бұрын

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!

@macroxela 2 ай бұрын

Where are you getting 1.5? Naive matrix multiplication is O(n^3) as you can see in the code he showed. And the current best runtime is O(n^2.371552).

@gowthamsrsk 2 ай бұрын

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

@LeninMcDonalds 2 ай бұрын

Slick video

@CarlosCosta-cz3hb 2 ай бұрын

Cicuitos etc . Cadrados Liga catro fiēs. Não ?

@javastream5015 2 ай бұрын

‼A CPU cache does NOT change the Big-O! Only the "cache" in your algorithm, which avoids re-computation.

@MomchilAtanasovHome 2 ай бұрын

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.