- Related Questions & Answers
- Little Oh Notation (o)
- Difference between Big-O and Little-O Notation
- Big Omega (Ω) and Big Thera (θ) Notation
- Asymptotic Notation - O(), o(), Ω(), ω(), and θ()
- Dot notation vs Bracket notation in JavaScript
- Sign Magnitude notation
- Comparison of memory-mapped I/O and I/O-mapped I/O
- I/O-mapped I/O or memory-mapped I/O in 8085 Microprocessor
- Dot notation in JavaScript
- I/O-mapped I/O in 8085 Microprocessor
- Merits of I/O-mapped I/O and demerits of memory-mapped I/O
- Demerits of I/O-mapped I/O and merits of memory-mapped I/O
- Big Numbers in Python
- Maximize big when both big and small can be exchanged in C++
- 1's complement notation

- 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-Oh (O) notation gives an upper bound for a function f(n) to within a constant factor.

We write f(n) = O(g(n)), If there are positive constants n0 and c such that, to the right of n0 the f(n) always lies on or below c*g(n).

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

Advertisements