Question

With the help of an example, briefly explain the dominant term in complexity.

Answer 1

• When determining the performance of an algorithm, we must also consider the term, which is an important component that influences the function's performance. Such a phrase is referred to as dominant.
• For example, let an algorithm have both a nested loop running it N² times and a single loop running N times. In this case, N² is the dominant term and hence, the complexity is O(N²).