Introduction and Complexity Functions (Big-Oh Bootcamp)
2Welcome to Big-Oh Bootcamp. In this video I place where the things we will study sit (between algorithms analysis and complexity results). Big-Oh is a valuable mathematical tool for describing the complexity of algorithms. Here I give some handy definitions: complexity functions, Big-Oh's definition, some helpful thoughts about it, usage, and common complexity functions.
Have a beautiful day!
Time Stamps:
0:00 What are we talking about?
6:23 Complexity functions
14:38 Formal Definition of Big-Oh
26:43 Two common usages.
39:14 Summary, why do we care about formal proof?
41:25 Common complexity functions.
47:15 Closing
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