#Day19 #100DaysOfCode
asymptotic analysis is the study of the change in performance of an algorithm with respective change in the dataset size.

asymptotic notation is a mathematical notation used to describe the running time of an algorithm with varying dataset size.

there are 3 types of asymptotic notations:

big-O notation: represents the upper-bound running time of an algo. gives the worse case complexity.

omega notation: represents the lower-bound running time of an algo. gives the best case complexity.

theta notation: represents both upper-bound and lower bound running time of an algo. gives the average case complexity.