Time Complexity of Algorithms and Asymptotic Notations [Animated Big Oh, Theta and Omega Notation]#1

Time complexity is, the relation of computing time and the amount of input.
The commonly used asymptotic notations used for calculating the running time complexity of an algorithm are:
Big oh Notation (Ο)
Omega Notation (Ω)
Theta Notation (θ)

##### 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