Computing
Complexity of
Algorithms

This
** preview**
has intentionally

**sections.**

*blurred***to view the full version.**

*Sign up*
Example Problems
1.
Algorithm A runs in O(N
2
) time, and for an input size
of 4, the algorithm runs in 10 milliseconds, how long
can you expect it to take to run on an input size of 16?
4
2
16
2
-----
=
-------
10
x
=>
x
= 100ms