Asymptotic Notation 5 - Big O Notation and Logs

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

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

  • @peacy7184
    @peacy7184 Год назад +1

    Very helpful, thanks!

  • @kiri374
    @kiri374 Год назад

    thank you professor painter

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

    thanks so much

  • @aryanvardhan809
    @aryanvardhan809 2 года назад

    Great video👍

  • @AviPars
    @AviPars 2 года назад +1

    Thanks, do you have more of these proof videos?

    • @ProfessorPainter
      @ProfessorPainter  2 года назад

      There are some older ones on my channel already if you haven't seen those yet! What type of problems would you like to see?

  • @cybersecurityblueprints3228
    @cybersecurityblueprints3228 2 года назад

    hi professor Painter can you help me with this question.Use the definition of Big-Oh to prove that 0.01nlog(n) -200n+6 is
    O(nlog(n)).

  • @kayd2143
    @kayd2143 2 года назад

    Naaaah this is genius