Big-Oh Definition, Proving 2n-1 is O(n) (FULL EXAMPLE)

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


Duration: 26:24
31 views
2

In today's lesson, we learn about what Big-Oh notation, some discussion about usage and what it is mathematically, then we see a proof using the definition (for an "is" claim). Ms. Kitty causes a bit of a ruckus as well, join the fun!

For many more examples proving Big-Oh claims and techniques, check out the Big-Oh Bootcamp series: https://www.youtube.com/playlist?list=PLN-ShipRKQ0hR6SZORT05Q2JedEGnXLbb

Time Stamps:
0:00 Opening, remarks about overall context
1:12 Big-Oh definition, and discussion
15:39 2n-1 is O(n) (full proof, with tips on how to approach proving Big-Oh claims)
26:04 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



Other Videos By PageWizard Games, Learning & Entertainment


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)
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


Tags:
Computer Science
Algorithms
Data Structures
Education
CompSci
CS
PageWizard
Mathematics
Accessibility
University
COMPSCI
COMP
CSCI
Western
Manitoba
StFX
Regina
Big-Oh
Big O
Big-O
Asymptotic notation
Asymptotic
Notation
2n-1
O(n)
O(1)
Proving
Proof
Easy