From 03697de47fb00cb2b85fa2e3e9dadad444537b6b Mon Sep 17 00:00:00 2001 From: Jake Levenson Date: Mon, 21 Jan 2019 10:02:45 -0500 Subject: [PATCH] Added descriptions for Little o and omega (#24554) --- guide/english/algorithms/algorithm-performance/index.md | 4 ++++ 1 file changed, 4 insertions(+) diff --git a/guide/english/algorithms/algorithm-performance/index.md b/guide/english/algorithms/algorithm-performance/index.md index 604148aa41..d615fc487e 100644 --- a/guide/english/algorithms/algorithm-performance/index.md +++ b/guide/english/algorithms/algorithm-performance/index.md @@ -49,6 +49,10 @@ The following 3 notations are mostly used to represent time complexity of algori 3. **Ω Notation**: Ω notation provides an lower bound to algorithm. it shows fastest possible answer for that algorithm. >Ω (g(n)) = {f(n): there exist positive constants c and n0 such that 0 <= cg(n) <= f(n) for all n >= n0}. + +4. **Little o Notation**: The little o notation defines a strict upper bound of an algorithm. This means that f(n) is less than c * g(n) for all c, but cannot be equal. + +5. **ω Notation**: ω (Little Ω) notation provides a strict lower bound to algorithm. This means that f(n) is greater than c * g(n) for all c, but cannot be equal. ## Examples