Asymptotic Notation - O(), o(), Ω(), ω(), and θ()

Asymptotic Notations

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 Notation

Big-Oh (O) notation gives an upper bound for a function f(n) to within a constant factor.

Little o Notations

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).

Big Omega Notation

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

Little ω Notations

Another asymptotic notation is little omega notation. it is denoted by (ω).

Little omega (ω) notation is used to describe a loose lower bound of f(n).

Big Theta Notation

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

Arnab Chakraborty

Published on 05-Aug-2019 06:19:15

• Related Questions & Answers
• Big Omega (Ω) and Big Thera (θ) Notation
• Difference between Big-O and Little-O Notation
• Big Oh Notation (O)
• Little Oh Notation (o)
• Comparison of memory-mapped I/O and I/O-mapped I/O
• What is Omega Switching Network in Computer Architecture
• 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
• I/O-mapped I/O or memory-mapped I/O in 8085 Microprocessor
• I/O-mapped I/O in 8085 Microprocessor
• I/O Systems and Subsystems
• Find median of BST in O(n) time and O(1) space in C++
• Find median of BST in O(n) time and O(1) space in Python
• Find duplicates in O(n) time and O(1) extra space - Set 1 in C++
• Print left rotation of array in O(n) time and O(1) space in C Program.