BIG O Notation Complete Tutorial A TO Z With Examples | Master Data Structures and Algorithms #1

Learn about Big O notation, an equation that describes how the run time scales with respect to some input variables. Calculating Asymptotic Time complexity can sometimes be very challenging to understand. This video throws light on the basics of Time complexity and Big O notation. TIMESTAMPS: 00:00 Intro 04:00 What is Good Code 06:40 What is BIG O 09:10 Example to Understand BIG O 22:55 Algorithmic Complexity 27:00 BIG O Chart 29:50 Constant Time Complexity 35:00 Linear Time Complexity 39:12 Two-Mins Break 41:50 Linear Time Complexity 46:45 Two For-loops Example 57:20 Channel Intro 59:20 1st Rule: Worst Case 1:08:50 2nd Rule: Remove Constants 1:13:10 3rd Rule: Different Terms For Different Inputs 1:18:30 Quadratic Time Complexity 1:25:00 4th Rule: Drop Non-Dominants 1:30:25 Space Complexity 1:36:11 What causes space complexity 1:36:45 Examples For Space Complexity 1:43:10 Adding Twitter Feature Example 1:49:45 Cheatsheet