- Related Questions & Answers
- Asymptotic Notation - O(), o(), Ω(), ω(), and θ()
- Big Oh Notation (O)
- Difference between Big-O and Little-O Notation
- Big Endian and Little Endian
- Maximize big when both big and small can be exchanged in C++
- Big Numbers in Python
- HTML <big> Tag
- The magnitude of big data
- How IoT impacts Big Data
- Rust Programming Language – Big Features
- C++ Program for quotient and remainder of big number
- Parsing and Formatting a Big Integer into Binary in Java
- Parsing and Formatting a Big Integer into Octal in Java
- Fade Down Big Animation Effect with CSS
- Android Notification Example with Vibration, Sound, Action and Big View Styles

- Selected Reading
- UPSC IAS Exams Notes
- Developer's Best Practices
- Questions and Answers
- Effective Resume Writing
- HR Interview Questions
- Computer Glossary
- Who is Who

Asymptotic notations are used to represent the complexities of algorithms for asymptotic analysis. These notations are mathematical tools to represent the complexities. There are three notations that are commonly used.

Big-Omega (Ω) notation gives a lower bound for a function f(n) to within a constant factor.

We write f(n) = Ω(g(n)), If there are positive constants n0 and c such that, to the right of n_{0} the f(n) always lies on or above c*g(n).

Ω(g(n)) = { f(n) : There exist positive constant c and n0 such that 0 ≤ c g(n) ≤ f(n), for all n ≤ n_{0}}

Big-Theta(Θ) notation gives bound for a function f(n) to within a constant factor.

We write f(n) = Θ(g(n)), If there are positive constants n0 and c_{1} and c_{2 }such that, to the right of n_{0} the f(n) always lies between c_{1}*g(n) and c_{2}*g(n) inclusive.

Θ(g(n)) = {f(n) : There exist positive constant c_{1}, c_{2} and n_{0} such that 0 ≤ c_{1} g(n) ≤ f(n) ≤ c_{2 }g(n), for all n ≥ n_{0}}

Advertisements