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

Question

Quizplus · Accepted Answer

Doubling the number of elements in an O(n^3) algorithm increases the number of visits by a factor of 2^3, which is 8.

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

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