Theta notation

Theta (Θ) notation describes an algorithm's efficiency by providing a tight bound on its running time or resource usage. It characterizes the exact growth rate, meaning the algorithm's performance is bounded both above and below by the same function, within constant factors, for large input sizes. Essentially, if an algorithm is Θ(n), its runtime grows proportionally to n as input size increases, ensuring predictability and consistency in how it scales. This notation helps compare algorithms and understand their long-term behavior as problem sizes become very large.