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)II and III only
B)II only
C)I and II only
D)I only

Question

Quizplus · Accepted Answer

In big-Oh notation, we ignore the coefficients of the terms (II) because they do not significantly affect the growth rate for large inputs. We also ignore all lower order terms (III) because, as the input size grows, their impact on the overall complexity becomes negligible compared to the highest order term.

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