Asymptotic Notation 5 - Big O Notation and Logs

preview_player
Показать описание
In this video we examine the complexity of an expression that involves logarithms and demonstrate how this changes our technique for analysis.
Рекомендации по теме
Комментарии
Автор

Thanks, do you have more of these proof videos?

AviPars
Автор

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

cybersecurityblueprints