Big Theta notation

Big Theta notation, often written as Θ, describes the exact growth rate of an algorithm’s running time or space relative to the size of its input. It provides a tight bound, meaning it indicates both the upper and lower limits of the resource requirements. In simpler terms, if an algorithm runs in Θ(n), it means that as the input size (n) increases, the time it takes to run the algorithm will increase proportionally, ensuring the algorithm's performance behaves consistently within that range under varying inputs. This helps in comparing the efficiency of algorithms.