Suppose we have two functions fff and gggwhich map positive integers to positive integers.
Name
Notation
Definition
"Big-O"
Less than or equal to
"Little-O"
Less than
"Big-Omega"
"Little-Omega"
Theta
A general formula to solve recurrence relation.`Suppose we have a recurrence relation that resembles the following.
Then, we have Θ(nd)\Theta(n^d)Θ(nd) if a<bda < b^da<bd, θ(ndlog(n))\theta(n^d\log(n))θ(ndlog(n)) if a=bda = b^da=bd, and Θ(nlogba)\Theta(n^{\log_ba})Θ(nlogba) for the final case.
Last updated 4 years ago