Neat optimization trick: reduce the number of jumps in a nested loop

By reordering nested loops you can easily achieve more efficient code, that is, with less code jumps. Credit for the original idea goes to “Code Complete” which was written by Steve McConnell but I am going to expand it a bit further with math… The example in that book compares these two versions of the same nested for loop: int a, b;for (a = 0; a < 10; a++)for (b = 0; b < 500; b++)printf("hi"); And int a, b;for (b = 0; b < 500; b++)for (a = 0; a < 10; a++)printf("hi"); You can easily see that the first example jumps 10 + 10*500 = 5010 times and the second one: 500 + 500*10 = 5500 but both loop the same number of times. That means that even though they both achieve the same thing, the first nested loop is a tad bit faster. But just how much is it faster? Could we calculate that? Calculating the possible efficiency gain First of all, let’s assume that and are two natural numbers. For example, we have two loops. The A loop: X Y int a, b;for (a = 0; a then the difference is negative, if == then difference is zero and if < then the difference is positive. What that means is that if < then we execute - less jump instructions in the A loop compared to the B loop. X X Y Y X Y Y X X Y X Y X Y X Y Y X You can see that this is indeed true by checking the original example. In the original example = 10, = 500. < is true and - is 490. The first loop loops 5010 times whereas the second one — 5500 times. The difference between them is 490 which is - ! X Y X Y Y X Y X In conclusion, you can say that the bigger the difference between and , the more you have to gain in terms of efficiency by reordering the loops in such a way that the smaller number is used in a for loop before . X Y X Y What about deeper nested loops? We could go on with the same reasoning for deeper nested loops but instead let’s frame the problem like this: we need to prove that a sum like + * + * * is minimal where , and are some natural numbers if and only if < < . My proof will be similar to mathematical induction. We already established before that + * is lower when < . So we can restructure that sum like this: + * ( + * ). We already know about the parentheses: for that sum to be minimal, has to be smaller than or, in other words, < It can obviously be seen that has to be as minimal as possible to minimize the whole sum. And that means that must be lower than and . Thus, we get that when < < then the sum is minimal. It is possible to extend this same logic to + * + * * + * * * and so forth. a a b a b c a b c a b c b b c b c a a b b c b c b c. a a b c a b c a a b a b c a b c d Summary The rule is this: when writing nested loops make sure that the variables that change the most are in the most inner loop and those which change the least — in the most outer loop. This significantly reduces the number of jumps if the number of loops is big. Please press the heart icon if you liked the content. It encourages me to write more stuff like this. Also, please comment if you found any errors in my reasoning.