Big Oh, Omega, and Theta, What are Asymptotic Notations?

We use Big Oh, Big Omega, and Theta notation to express the complexity of an algorithm. In this video, we explore the definition of these terms, along with examples. This is first video of a series on Algorithms. ------------------ Time Stamps: 00:00 Asymptotic Notation 00:40 - Rule 1: Bounds 01:22 - What is Input Size? 02:23 - Rule 2: Only Large n matters 05:05 - Rule 3: Ignore Constants 06:38 - First Example 07:38 - General Example. Big Oh of a polynomial. 08:35 - More Examples 10:05 - Important Big Oh Functions 10:55 - Big Omega 11:37 - Big Theta ------------------ IdeaBehind Series on Algorithms is a series of 15-20 (we'll count later) animated videos exploring, otherwise mysterious, algorithms in an intuitive perspective. Feedback and suggestions are welcome. ------------------ Bundle of thanks to Reed Mathis for background music. Animations done in ManimGL with Huge Thanks to Grant Sanderson.