What's with Zero? O(0)? O(1)? Is O(0) = O(1)?
3In today's lesson we explore a mathematical question about Big-Oh, if we permit our complexity functions to take on a value that is 0 (something you won't encounter in analyzing the running time of an algorithm, as algorithms take at least one operation [or else there's no instructions to follow, an empty program/algorithm]). We see how 0 behaves a bit differently than any other constant function does, and naturally is an edge case that tends to get overlooked when discussing constant functions.
Time Stamps:
0:00 Setup
0:16 Proving 0 is O(1) [with tips]
4:51 Some discussion
6:15 Is O(0) = O(1)?
17:30 Answer, the differences between O(0) and O(1), and some discussion about why we often write O(1) as opposed to O(c) for some constant c.
19: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