Complex Algorithms

Level pending

An algorithm takes a number, \(N\), and returns a list of numbers, all divisors of \(N\). You may have ideas on how to implement such a problem, but you observe the following runtimes as \(N\) grows. Which of these runtimes is the best upper bound for the algorithm?

\(N\)Runtime (seconds)
31
64
99
1216
×

Problem Loading...

Note Loading...

Set Loading...