Big-Omega Definition, Proving log n + 2 is Ω(log n) (FULL EXAMPLE)

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


Category:
Vlog
Duration: 11:07
26 views
4

Today we see the other counterpart to Big-Oh notation, representing an asymptotic lower bound, Big-Omega notation. We see the definition, a basic property it has, and a full basic example that contains logarithms! I encourage you to pick up my earlier example and prove using the property shown the relationship there via Big-Omega!

Time Stamps:
0:00 Introduction
0:30 Definition of Big-Omega, a property
2:50 Full example, proving log n + 2 is O(log n).
10:46 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
#BigOmega



Other Videos By PageWizard Games, Learning & Entertainment


2022-12-09Two Winnipeggers Have the Same Numbers of Hairs on the Top of Their Head! (Pigeonhole Principle)
2022-12-09Large (Enough) Groups and the Pigeonhole Principle (Mathematics for Computer Science)
2022-12-09Dan Plays Pokemon Scarlet (December 8, 2022)
2022-12-07Divisible By Ms. Kitty (The Fall of Ms. Kitty)
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)


Tags:
Computer Science
Algorithms
Data Structures
Education
CompSci
CS
PageWizard
Mathematics
Accessibility
University
COMPSCI
COMP
CSCI
Western
Manitoba
StFX
Regina
Big-Omega
notation
Ω
Big Omega notation
log n
big-omega
lower bound
asymptotics