I have an algorithm that runs in ON²), where Nis the size of the problem. For N = 100, the time for the algorithm to run is 1 minute. How long does the algorithm take for N=1000? A) Same time B) 10 minutes C) 100 minutes D) 1000 minutes

Question

Quizplus · Accepted Answer

The algorithm runs in O(N^2) time complexity. If N increases from 100 to 1000, the time increases by a factor of (1000/100)^2 = 10^2 = 100. Therefore, it will take 100 minutes.

I Have an Algorithm That Runs in ON2), Where Nis

I Have an Algorithm That Runs in ON²), Where Nis