Big-O Notation in 3 Minutes

Поделиться
HTML-код
  • Опубликовано: 23 дек 2024

Комментарии • 39

  • @peterhung3840
    @peterhung3840 Месяц назад +2

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

  • @funkykong9001
    @funkykong9001 Месяц назад +24

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

  • @gergelyfarago8544
    @gergelyfarago8544 Месяц назад +13

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

    • @SantiagoArizti
      @SantiagoArizti Месяц назад

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

  • @wasimxcode
    @wasimxcode Месяц назад +5

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

  • @juanmacias5922
    @juanmacias5922 Месяц назад +8

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

  • @TheBenito78
    @TheBenito78 Месяц назад +2

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

  • @marc-speaks
    @marc-speaks Месяц назад +6

    Best explainer I have seen

  • @andreigabe4666
    @andreigabe4666 Месяц назад +3

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

  • @renatobrakarz3499
    @renatobrakarz3499 Месяц назад +5

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

  • @Biometrics
    @Biometrics Месяц назад +1

    Thank you! This is simple and easy to visualize.

  • @bananesalee7086
    @bananesalee7086 Месяц назад

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

  • @raj_kundalia
    @raj_kundalia 18 дней назад

    Thank you for doing this!

  • @AleksandarT10
    @AleksandarT10 Месяц назад +3

    great tips!

  • @kilosierraalpha
    @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.

  • @RoshiniAjoy
    @RoshiniAjoy Месяц назад +2

    🙏🙏🙏 Thank you

  • @crazywill32
    @crazywill32 Месяц назад

    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.

  • @gedecandra7722
    @gedecandra7722 Месяц назад

    Thank You for sharing this 👍

  • @sanjaynaik2325
    @sanjaynaik2325 Месяц назад

    how to make interactive digrams like you?

  • @VolodymyrMartynov-hi4tj
    @VolodymyrMartynov-hi4tj Месяц назад

    Thank you so much!

  • @stachowi
    @stachowi Месяц назад

    fantastic and short.

  • @croosed
    @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...

  • @IvanSoregashi
    @IvanSoregashi Месяц назад

    Thanks

  • @OGMadMax
    @OGMadMax Месяц назад

    How are these animations made?

    • @r21d
      @r21d 13 дней назад

      Well

  • @gowthamsrsk
    @gowthamsrsk Месяц назад

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

  • @marsim4150
    @marsim4150 Месяц назад

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

  • @manu-singh
    @manu-singh Месяц назад +2

    amazingg

  • @CarlosCosta-cz3hb
    @CarlosCosta-cz3hb Месяц назад

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

  • @javastream5015
    @javastream5015 Месяц назад +1

    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
      @macroxela Месяц назад +3

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

  • @javastream5015
    @javastream5015 Месяц назад

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

  • @carloskassab2962
    @carloskassab2962 Месяц назад +2

    First 🥇!

  • @LeninMcDonalds
    @LeninMcDonalds Месяц назад

    Slick video

  • @mascogreen8153
    @mascogreen8153 Месяц назад

    ByteByteGo is the man. Thank you.

  • @MomchilAtanasovHome
    @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.

  • @CarlosCosta-cz3hb
    @CarlosCosta-cz3hb Месяц назад

    Já vi binário ali
    Não existe binário
    É facil
    Falta +1

  • @DENDUA-TECH
    @DENDUA-TECH Месяц назад +2

    First Comment