BigThetaNotation.md (358B)
1 # Big Theta Notation 2 3 CS 303 Ch 2 4 5 **Definition:** We use big theta notation to state that an algorithm has exactly the same asymptotic complexity as some other algorithm. This means big theta of f is equivalent to big theta of g where each of them will (almost always) have a unique value for c (constant multiplier) and a unique value for N (where N <=x).