In big-Oh notation, suppose an algorithm requires an order of n3 element visits.How does doubling the number of elements affect the number of visits?
A)It number of visits goes up by a factor of eight.
B)It triples the number of visits.
C)It quadruples the number of visits.
D)It doubles the number of visits.

Question

Quizplus · Accepted Answer

Doubling the number of elements in an algorithm that requires $n^3$ element visits means the new number of visits will be $(2n)^3 = 8n^3$, which is an increase by a factor of eight.

In Big-Oh Notation, Suppose an Algorithm Requires an Order of N3