# Running time of simple for-loops

I'm reading algorithms and I understand most of it, one thing that I can still struggle with a lot is something as simple as running times on different for-loops. Everyone seems to have easy with that, except for me and therefore I search help here.

I am currently doing some excercises from my book and I need help completing them in order to figure out the different running times.

The title of the exercise is: "Give the order of growth(as a function of N) of the running times of each of the following code fragments"

a:

int sum = 0;
for (int n = N; n > 0; n /= 2)
for(int i = 0; i < n; i++)
sum++;


b:

int sum = 0;
for (int i = 1; i < N; i *= 2)
for(int j = 0; j < i; j++)
sum++;


c:

int sum = 0;
for (int i = 1; i < N; i *= 2)
for(int j = 0; j < N; j++)
sum++;


We have learned different kinds of running times/order of growth like n, n^2, n^3, Log N, N Log N etc. But I have hard understanding which to choose when the for loop differs like it does. the "n, n^2, n^3" is not a problem though, but I can't tell what these for-loops running time is.

Here's an attempt of something.. the y-axis represents "N" value and the x axis represents times the outer loop has been run. The drawings in the left is: arrow to the right = outer-loop, circle = inner loop and the current N value. I have then drawn some graphs just to look at it but I'm not sure this is right though.. Especially the last one where N remains 16 all the time. Thanks.

• Well, compute a few iteration numbers and see how they vary with N. If necessary, plot the values onto checkered paper. You'll see son enough what looks like a parabola, like a linear function, like a logarithm, etc. – Kilian Foth Aug 15 '14 at 14:30
• Make sure turning optimizations off. Chances are, that the compiler may be able to determine the end result if all input is known at compile time and the resulting code runs in O(1). – JensG Aug 15 '14 at 14:34
• Sorry, I meant "compute the number of times the loop body runs by playing it through on paper". No danger of secret optimization there! – Kilian Foth Aug 15 '14 at 14:49
• Start by calculating the number of iterations for the outer loops (I won't tell you the solution - work it out by yourself!). Come back when you got that result. – Doc Brown Aug 15 '14 at 15:15
• Hello all, thanks for the really good ideas, I will try and draw these things on paper and then make a graph and compare that to the different times. Really great idea and a good way to learn it. I'll come back with some results later, to see if you guys agree. – owwyess Aug 15 '14 at 15:44

# Background

• For an arbitrary for loop such as:

for (int p = …; …)
do_something(p);


it should be clear that the run time of this loop is simply the sum of the run times of the inner computations (i.e. do_something(p) in this case). Note that the run time of the inner computation may depend on the loop variable(s).

In the special case where the run time of do_something(p) is independent of the loop variable(s), the run-time is then proportional to the number of times the inner computation is executed.

• Typically, simple arithmetic such as incrementing (sum++) are constant-time operations.

• For brevity I will use log to denote the base-2 logarithm. Additionally, I will use pow(x, y) to denote x raised to the power y because ^ is often used for something else in the C-family of languages.

# The problems

The interesting coincidence in this set of problems is that the run time of each computation is actually proportional to the final value of the sum (can you see why?) so the question can be simplified to: how does the final value of sum vary with the parameter N?

The sum can be calculated algebraically, but we don't need to know the exact result. We just need to make some good estimates.

## Problem A

int sum = 0;
for (int n = N; n > 0; n /= 2)
for (int i = 0; i < n; i++)
sum++;


How many times does the outer loop run? It starts at N and goes down by half each time until it hits zero. This is just (a discrete version of) an exponential decay with a base of 2. Therefore, we can make an educated guess that

n ∝ 1 / pow(2, p)    [approximately]


Here, we define p to be a counter that increases by 1 each time the outer loop is repeated. In fact, this is exactly what your graph plots.

Where does p start? We can just pick p_start = 0 for convenience, and this allows us to determine the coefficient of proportionality:

 n ≈ N / pow(2, p)


Where does p end? Whenever n reaches zero! Since this is integer division, n can only be zero if N < pow(2, p). From this we can deduce that p_end ≈ log(N) (base-2 logarithm). With experience, you can easily skip this entire analysis and jump straight to this conclusion instead.

Now we can rewrite the loop using the variable p instead of n (again, approximately). Notice that every instance of n must be substituted:

int sum = 0;
for (int p = 0; p < log(N); p++)
for (int i = 0; i < N / pow(2, p); i++)
sum++;


The advantage of writing the loop like this is that it becomes obvious how many times the outer loop is repeated. (Keen readers may notice that this is

The inner loop consists of only increments to sum and is repeated N / pow(2, p) times, so we can just rewrite the above to:

int sum = 0;
for (int p = 0; p < log(N); p++)
sum += N / pow(2, p);


(Note that the run time of this loop may no longer be the same, but the value of sum still reflects the run time of the original problem.)

From this code we can write the value of sum as:

$\dpi{150} \text{sum} \approx \sum_{p = 0}^{\log N} \frac{N}{2^p}$

(As randomA noted, this is just a geometric series so there is a well-known closed-form expression for the sum. Here I use a more general technique based on calculus, however.)

This can be simplified further by approximating the summation as an integral:

$\dpi{150} \text{sum} \approx \int_0^{\log N} \frac{N}{2^p} \, \mathrm d p \approx \frac{N}{\ln 2}$

And there you go, the run time of the problem A is linear with respect to N.

## Problem B

int sum = 0;
for (int i = 1; i < N; i *= 2)
for (int j = 0; j < i; j++)
sum++;


The problem here is similar, but I'll omit some of the steps. The variable i grows exponentially, so we can do the transformation:

i ≡ pow(2, p)


with p increasing by one at each iteration, starting from 0, and ending at log(N). After variable substitution, the loop becomes:

int sum = 0;
for (int p = 0; p < log(N); p++)
for (int j = 0; j < pow(2, p); j++)
sum++;


which reduces to:

int sum = 0;
for (int p = 0; p < log(N); p++)
sum += pow(2, p);


You can apply the same tricks again to find a closed-form expression for the sum: it is also O(N).

## Problem C

int sum = 0;
for (int i = 1; i < N; i *= 2)
for (int j = 0; j < N; j++)
sum++;


This one is actually quite a bit easier because the number of repeats of the inner loop doesn't depend on the outer loop variable, so we can go right away and simplify this to:

int sum = 0;
for (int i = 1; i < N; i *= 2)
sum += N;


The loop has the same exponential behavior as in Problem B, so it is run only log(N) times, so this can then be simplified to:

int sum = 0;
sum += log(N) * N;


Hence, the run time is O(N log(N)).

• Wow this looks really good, It's 5am here now though but I can't wait to read this when I get up tomorrow! I'll be right back at ya! – owwyess Aug 16 '14 at 2:47
• Another way to see O(n) for the case a) and b) is using (1 - a^(n+1)) = (1-a)(1 + a + a^2 + ... + a^n). This means the sum is less than 2n. – InformedA Aug 16 '14 at 6:23
• @Rufflewind Thank you for this amazing work and I've now thoroughly read it a few times. The level I'm studying algorithms in is not high which makes me struggle a bit in some parts of your explanations. As in problem A, we conclude that the running time is linear with respect to N. However, the graph I have made does not show a linear graph? And I am therefore not sure why this is. Thanks again! Amazing work – owwyess Aug 16 '14 at 17:57

The actual running time is less important than the growth of the running time as a function of the algorithm's inputs from the theoretical perspective of studying algorithms. Real world is typically different.

Regardless, the book is probably discussing running times as a way to illustrate different code structures.

A simple Java example for timing code looks like the following. Most popular languages have a similar way of accomplishing the same thing.

long begin = System.currentTimeMillis();
// Do some stuff
long interval = System.currentTimeMillis() - begin;
System.out.println("The algorithm took " + interval + "ms to process");


Use this programming idiom for each code structure you listed and compare the results. That sounds like what the book is telling you.

Given how fast modern CPUs are and how effective modern compilers are at optimization, I would recommend looping millions of times to get an accurate comparison. That means the variable N in your code should be quite large. I would also run each algorithm several times and take the average.

The reason for that is there is overhead associated with any code. To have an accurate comparison you want to make sure factors such as cache misses are minimized.