Big-Theta Definition, Usage, Proving 3n^3 + 5 is Θ(n^3)
3Today we study a "tight" asymptotic notation called Big-Theta, how really when you study algorithms analysis you're often implicitly pursuing this kind of result, and a full example (proof)!
Time Stamps:
0:00 Opening and Recap
0:25 Big-Theta definition
2:25 Usage of Big-Theta, why consider this asymptotic notation?
6:51 Summary of "Game Plan" for proving Big-Theta claims.
7:38 Full example, proving 3n^3 + 5 is Big-Theta of n^3.
16:43 Closing
Have a beautiful day!
Supporters (to date of publication, by tier (top to bottom)):
----------------------------------------------------------
Patreon Supporters (General Support):
Draikou
Patreon Supporters (Basic Support):
Patreon Supporters (Supporter Access!):
Eric R
-----------------------------------------------------------
Become a supporter today! To support my work and mission to provide free or accessible Computer Science education (especially in theory), subscribe to the channel, share my videos. Please donate and contribute to support my work for more content:
PATREON: https://www.patreon.com/PageWizard
SUBSCRIBESTAR: https://www.subscribestar.com/drpage
PAYPAL: https://paypal.me/pagewizard
Follow also at:
FACEBOOK: https://www.facebook.com/DanielRPage
TWITTER: https://twitter.com/PageWizardGLE
QUORA: https://www.quora.com/profile/Daniel-R-Page
TWITCH: https://www.twitch.tv/pagewizard
#ComputerScience
#Algorithms
#bigo