Big O notation is simpler than you might think
Big O notation is a very popular topic, in contexts such as algorithms and P vs NP. In this video, I attempt to explain big O notation using only basic arithmetic, so that these other topics can be enjoyed by everyone! Timestamps: Intro: 00:00 Eventuality: 00:28 Deltas: 03:54 Stolz-Cesàro: 06:12 Adding sequences: 09:05 Conclusions: 12:35
▶︎
The Mystery of the Fibonacci Cycle
▶︎
The most beautiful formula not enough people understand
▶︎
The Strange Math That Predicts (Almost) Anything
▶︎
MIT Godel Escher Bach Lecture 1
▶︎
Practical Big-O Notation (Think Like a Programmer)
▶︎
Terence Tao: Nobody Understands Why AI Actually Works
▶︎
Hilbert's Curve: Is infinite math useful?
▶︎
Why π^π^π^π could be an integer (for all we know!).
▶︎
Tesla’s 3-6-9 and Vortex Math: Is this really the key to the universe?
▶︎
Something strange happens when you "bump the base"
▶︎
The Oldest Unsolved Problem in Math
▶︎
The Simplest Ancient Math Problem No One Could Solve
▶︎
Why Nature Requires Complex Numbers
▶︎
Olympiad level counting (Generating functions)
▶︎
We're 99.9% sure this pattern is true, but no one can prove it
▶︎
Terence Tao on the cosmic distance ladder
▶︎
There Is Something Faster Than Light
▶︎
Big-O notation in 5 minutes
▶︎
Biggest Puzzle in Computer Science: P vs. NP
▶︎