105,596 views
Analyzing our code to determine how it behaves with different inputs is not that difficult once you learn Big O asymptotic notation. Learn how to calculate Big O when your code has loops using Insertion Sort as an example. Introduction to Algorithms (English): https://amzn.to/3bcPoK9 Book in Spanish: https://amzn.to/33AxEUg Content: 0:00 Intro 1:00 Time Complexity 3:03 Asymptotic Notation 4:14 Big O Notation 5:39 Analyzing Loops 8:47 Analyzing Insertion Sort 12:03 Farewell Recommended books and gear: 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