Asymptotic Notations | Big O | Big Omega | Theta Notations | Most Imp Topic Of Algorithm
Asymptotic Notations
Notation that is used to describe the running time of an algorithm is called Asymptotic Notation - i.e. how much time an algorithm takes with a given input, n. There are three different notations: big O, big Theta (Θ), and big Omega (Ω).
#algorithm #solveRecurrenceRelation #algorithms