Big-Theta notation

Big-Theta notation is the tight bound on the runtime of an algorithm. This is only really defined when some function is the following using Big-O notation and then we have using Big-Theta notation this is also an equivalence relation, so as well.