- Related Questions & Answers
- Big Oh Notation (O)
- Difference between Big-O and Little-O Notation
- Asymptotic Notation - O(), o(), Ω(), ω(), and θ()
- Big Endian and Little Endian
- Dot notation vs Bracket notation in JavaScript
- Sign Magnitude notation
- Fermat's little theorem in C++
- Comparison of memory-mapped I/O and I/O-mapped I/O
- Dot notation in JavaScript
- I/O-mapped I/O or memory-mapped I/O in 8085 Microprocessor
- 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
- 1's complement notation
- 2'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

There are some other notations present except the Big-Oh, Big-Omega and Big-Theta notations. The little o notation is one of them.

Little o notation is used to describe an upper bound that cannot be tight. In other words, loose upper bound of f(n).

Let f(n) and g(n) are the functions that map positive real numbers. We can say that the function f(n) is o(g(n)) if for any real positive constant c, there exists an integer constant n0 ≤ 1 such that f(n) > 0.

Using mathematical relation, we can say that f(n) = o(g(n)) means,

If f(n) = n^{2} and g(n) = n^{3} then check whether f(n) = o(g(n)) or not.

The result is 0, and it satisfies the equation mentioned above. So we can say that f(n) = o(g(n)).

Advertisements