37,919 views
Big O notation is used to determine the time complexity of our algorithms. In this video we will see three methods to determine the Big O complexity of recursive algorithms. Using the substitution method, the recursive tree method and the master method. Algorithm Analysis Books: https://amzn.to/3bcPoK9 https://amzn.to/33AxEUg Methods Explained: https://www.geeksforgeeks.org/analysi... Solving Recurrences: http://delta.cs.cinvestav.mx/~adiaz/a... https://www.usna.edu/Users/cs/taylor/... Explanation for algorithms like fibonacci in trees: https://web.stanford.edu/class/archiv... https://mitocw.ups.edu.ec/courses/ele... Contents: 0:00 Intro 0:46 Big O 1:16 Big O Formal Definition 1:45 How to Analyze Recursive Algorithms 2:20 Recurrences 5:43 1. Substitution Method 6:30 Substitution Example 7:39 Proof 10:09 2. Tree Method Recursive 14:30 3. Master Method Recommended books: https://kit.co/schiob Support me with a pizza: https://www.buymeacoffee.com/schiob For behind-the-scenes content and food photos follow me at: /schiob/schiob https://github.com/schiob