A good rule of thumb is: the slower the asymptotic growth rate, the better the algorithm.
Using asymptotic analysis, we can very well conclude the best case, average case, and worst case scenario of an algorithm and
in this Video we'll learn Rules to Calculate Asymptotic Analysis
##### Resources ######
http://science.slc.edu/~jmarshall/courses/2002/spring/cs50/BigO/index.html
##### TIME COMPLEXITY SERIES #######
1. Time Complexity and Asymptotic Notation : https://youtu.be/bxgTDN9c6rg
2. Logs and Summations for Time Complexity : https://youtu.be/WrsZX7ue2n0
3. Rules of Asymptotic Notations : https://youtu.be/NNxfSOtOd04
4. Problems on Asymptotic Notations : https://youtu.be/8K4CKGMjoS4
5. Time Complexity of Insertion, Bubble and Selection Sort : https://youtu.be/peLS-S23TvE
Facebook: https://www.facebook.com/Codearchery