Asymptotic Notation and Small Functions (with Full Examples)

Channel:
Canada PageWizard Games, Learning & Entertainment
Subscribers:
780
Published on ● Video Link: https://www.youtube.com/watch?v=_qh3eiqfXrk


Duration: 2:59:12
16 views
1

Today we will explore asymptotic notation and complexity functions, Big-Oh, Big-Omega, Big-Theta, and little-Oh. We will see full examples, with an emphasis on smaller functions. At the end we'll answer the question of whether there are even algorithms that can match some of these running times? For example, is there a o(1)-time algorithm?

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

Follow also at:
FACEBOOK: https://www.facebook.com/DanielRPage
TWITTER: https://twitter.com/PageWizardGLE
QUORA: https://www.quora.com/profile/Daniel-...
TWITCH: https://www.twitch.tv/pagewizard

#ComputerScience
#BigO
#littleO



Other Videos By PageWizard Games, Learning & Entertainment


2022-12-07Pigeonhole Principle [FULL PROOF] (Mathematics for CS)
2022-12-06Pigeonhole Principle and Averaging Principle (Mathematics for Computer Science)
2022-12-05Proving 1/n is o(1) (Little-Oh Definition Proof)
2022-12-02What is little-Oh? "Is" and "not is" Claims!
2022-12-02Dan Plays Pokemon Scarlet (December 1, 2022)
2022-11-30Big-Theta Definition, Usage, Proving 3n^3 + 5 is Θ(n^3)
2022-11-28Big-Omega Definition, Proving log n + 2 is Ω(log n) (FULL EXAMPLE)
2022-11-25What's with Zero? O(0)? O(1)? Is O(0) = O(1)?
2022-11-24Dan Plays Pokemon Scarlet (COME JOIN THE FUN IN THE CHAT)!
2022-11-23Big-Oh Definition, Proving 2n-1 is O(n) (FULL EXAMPLE)
2022-11-22Asymptotic Notation and Small Functions (with Full Examples)
2022-11-215. Myopic and Comparison Strategies for k-Canadian Travelling (Haunted Escape)
2022-11-184. Deterministic Lower Bound for k-Canadian Travelling (Haunted Escape)
2022-11-18Dan Plays Pocky & Rocky: Reshrined (JOIN THE FUN IN THE CHAT)
2022-11-16Ms. Kitty Learns Dijkstra's Algorithm with Ms. Kitty
2022-11-163. Reposition Strategy for k-Canadian Travelling (Haunted Escape)
2022-11-142. Competitiveness of Online Algorithms (Haunted Escape)
2022-11-111. k-Canadian Traveller & Problem Setup (Haunted Escape)
2022-11-11Dan Plays Legend of Zelda: Link's Awakening DX (PJ STREAM, JOIN THE FUN)
2022-11-09Proving 1 + 2 + 3 + … + n = n(n+1)/2 using Mathematical Induction
2022-11-09Haunted Escape (Intro to k-Canadian Traveller and Online Algorithms)