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.
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.
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...
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.
This video is the most valuable 3 minutes I had this week.
That was an amazing explanation and the visualizations were perfect. Thank you!
Thank you, great video! Quick remark: at 2:17 image should be cache-*un*friendly for column-by-column traversial.
also, the indexes are mixed up there, it still says [i][j] and should say [j][i]
No one makes visual likes you. How things are work ❤
Thank you for the awesome explainer, and the added context needed for real world computing at the end.
What a sense of clarity and synthesis ... Bravo!
Best explainer I have seen
You help me alot, Thankyou for giving this kinds of video.
First! From Brazil, in 25 seconds!
Primeiro! Do Brasil, em 25 segundos!
Thank you! This is simple and easy to visualize.
whoa already a million sub ! congrats man, youtube does reward the good creators
Thank you for doing this!
great tips!
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.
🙏🙏🙏 Thank you
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.
Thank You for sharing this 👍
how to make interactive digrams like you?
Thank you so much!
fantastic and short.
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...
Thanks
How are these animations made?
Well
I didn't understand anything, so what can i do?
Would anyone be able to guide me?
please make a video about how you make your wonderful animated infographics pleeeeaasse 🙂
amazingg
Cicuitos etc . Cadrados
Liga catro fiēs.
Não ?
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!
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).
‼A CPU cache does NOT change the Big-O!
Only the "cache" in your algorithm, which avoids re-computation.
First 🥇!
Slick video
ByteByteGo is the man. Thank you.
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.
Já vi binário ali
Não existe binário
É facil
Falta +1
First Comment