Is it faster to count down than it is to count up?

by

Is it really true? and if so does anyone know why?

In ancient days, when computers were still chipped out of fused silica by hand, when 8-bit microcontrollers roamed the Earth, and when your teacher was young (or your teacher’s teacher was young), there was a common machine instruction called decrement and skip if zero (DSZ). Hotshot assembly programmers used this instruction to implement loops. Later machines got fancier instructions, but there were still quite a few processors on which it was cheaper to compare something with zero than to compare with anything else. (It’s true even on some modern RISC machines, like PPC or SPARC, which reserve a whole register to be always zero.)

So, if you rig your loops to compare with zero instead of N, what might happen?

  • You might save a register
  • You might get a compare instruction with a smaller binary encoding
  • If a previous instruction happens to set a flag (likely only on x86 family machines), you might not even need an explicit compare instruction

Are these differences likely to result in any measurable improvement on real programs on a modern out-of-order processor? Highly unlikely. In fact, I’d be impressed if you could show a measurable improvement even on a microbenchmark.

Summary: I smack your teacher upside the head! You shouldn’t be learning obsolete pseudo-facts about how to organize loops. You should be learning that the most important thing about loops is to be sure that they terminate, produce correct answers, and are easy to read. I wish your teacher would focus on the important stuff and not mythology.

More Related Contents:

  1. break statement doesn’t work in a loop [closed]
  2. How to iterate over this series 5 6 7 6 5 6 7 6 5 6 7 6 5… in C? [closed]
  3. Finding target sum of two numbers in array
  4. Improve INSERT-per-second performance of SQLite
  5. Why does the order of the loops affect performance when iterating over a 2D array?
  6. Validate the type of input in a do-while loop C
  7. For vs. while in C programming?
  8. Trying to understand gcc option -fomit-frame-pointer
  9. Which ordering of nested loops for iterating over a 2D array is more efficient [duplicate]
  10. What is the fastest way to swap values in C?
  11. Why vectorizing the loop does not have performance improvement
  12. Efficient 4×4 matrix vector multiplication with SSE: horizontal add and dot product – what’s the point?
  13. No performance gain after using openMP on a program optimize for sequential running
  14. When is assembly faster than C? [closed]
  15. AVX/SSE version of xorshift128+
  16. Why is memcmp so much faster than a for loop check?
  17. How to optimize these loops (with compiler optimization disabled)?
  18. How does the CPU cache affect the performance of a C program
  19. why does GCC __builtin_prefetch not improve performance?
  20. Concatenating strings in C, which method is more efficient?
  21. faster alternative to memcpy?
  22. When implementing an infinite loop, is there a difference in using while(1) vs for(;;) vs goto (in C)?
  23. Is there any way to loop through a struct with elements of different types in C?
  24. Faster approach to checking for an all-zero buffer in C?
  25. Inline function v. Macro in C — What’s the Overhead (Memory/Speed)?
  26. Is x += 1 more efficient than x = x + 1?
  27. How can I optimize these loops (with compiler optimization disabled)?
  28. Why vectorizing the loop over 64-bit elements does not have performance improvement over large buffers?
  29. How can I break out of two nested for loops in Objective-C?
  30. How much overhead can the -fPIC flag add?

Leave a Comment