info/developer-roadmap
1
0
Fork 0
mirror of https://github.com/kamranahmedse/developer-roadmap.git synced 2025-08-18 23:21:18 +02:00
Code Issues Releases Wiki Activity

Update 101-big-theta.md (#7364)

Browse Source 
* Update 101-big-theta.md

Replace 'Theta' with 'θ' where applicable and remove unnecessary escaping

* Update 101-big-theta.md

Remove unnecessary parentheses
This commit is contained in:
lerethel
2024-10-08 14:43:12 +03:00
committed by GitHub
parent 191ca24c93
commit 6e1e045773
1 changed files with 1 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
src/data/roadmaps/datastructures-and-algorithms/content/104-algorithmic-complexity/103-asymptotic-notation/101-big-theta.md
View File

@@ -1,3 +1,3 @@
# Big-θ Notation # Big-θ Notation
Big Theta \(\Theta\) notation is used in computer science to describe an asymptotic tight bound on a function. This essentially means it provides both an upper and lower bound for a function. When we say a function f(n) is \(\Theta(g(n))\), we mean that the growth rate of f(n) is both bounded above and below by the function g(n) after a certain point. This is more precise than Big O and Big Omega notation, which provide only an upper and a lower bound, respectively. Big Theta notation tells us exactly how a function behaves for large input values. For example, if an algorithm has a time complexity of \(\Theta(n^2)\), it means the running time will increase quadratically with the input size. Big Theta (θ) notation is used in computer science to describe an asymptotic tight bound on a function. This essentially means it provides both an upper and lower bound for a function. When we say a function f(n) is θ(g(n)), we mean that the growth rate of f(n) is both bounded above and below by the function g(n) after a certain point. This is more precise than Big O and Big Omega notation, which provide only an upper and a lower bound, respectively. Big Theta notation tells us exactly how a function behaves for large input values. For example, if an algorithm has a time complexity of θ(n^2), it means the running time will increase quadratically with the input size.