Theta notation (Θ(g(n)) represents the upper and lower bounds of an algorithm’s time complexity, suggesting a tight bound.
The term f(n)=Θ(g(n)) means that there are positive constants c 1 and c 2 such that for all sufficiently large values of n, the function f(n) lies between c 1⋅g(n) and c 2⋅g(n).