In big-Oh notation, when we consider the order of the number of visits an algorithm makes, what do we ignore?
I power of two terms
II the coefficients of the terms
III all lower order terms
A) I
B) II
C) I and II
D) II and III

Question

Quizplus · Accepted Answer

In big-Oh notation, we ignore the coefficients of the terms and all lower order terms to focus on the term with the highest growth rate.

In Big-Oh Notation, When We Consider the Order of the Number