Performance wise, how fast are Bitwise Operators vs. Normal Modulus?

by

Unless you’re using an ancient compiler, it can already handle this level of conversion on its own. That is to say, a modern compiler can and will implement i % 2 using a bitwise AND instruction, provided it makes sense to do so on the target CPU (which, in fairness, it usually will).

In other words, don’t expect to see any difference in performance between these, at least with a reasonably modern compiler with a reasonably competent optimizer. In this case, “reasonably” has a pretty broad definition too–even quite a few compilers that are decades old can handle this sort of micro-optimization with no difficulty at all.

More Related Contents:

  1. How do you set, clear, and toggle a single bit?
  2. How do I set, clear, and toggle a single bit?
  3. How to set, clear, and toggle a single bit?
  4. Determine if int is not 0 with no if statements
  5. Best practices for circular shift (rotate) operations in C++
  6. What is Bit Masking?
  7. How to create a byte out of 8 bool values (and vice versa)?
  8. Examples of when a bitwise swap() is a bad idea?
  9. C/C++: Force Bit Field Order and Alignment
  10. What is the efficient way to count set bits at a position or lower?
  11. What is the idea behind ^= 32, that converts lowercase letters to upper and vice versa?
  12. How to perform a bitwise operation on floating point numbers
  13. In C/C++ what’s the simplest way to reverse the order of bits in a byte?
  14. Weird behavior of right shift operator (1 >> 32)
  15. Should I use #define, enum or const?
  16. How to add two numbers without using ++ or + or another arithmetic operator
  17. Casting float to int (bitwise) in C
  18. What does the statement if (counter & (1
  19. Using bitwise operators for Booleans in C++
  20. get absolute value without using abs function nor if statement
  21. What happens when you bit shift beyond the end of a variable?
  22. Near constant time rotate that does not violate the standards
  23. What’s the fastest way to pack 32 0/1 values into the bits of a single 32-bit variable?
  24. Encoding int value as an IEEE-754 float (binary32)
  25. What is going on with bitwise operators and integer promotion?
  26. Decimal to Binary
  27. Difference between | and || , or & and && [duplicate]
  28. Fastest way to produce a mask with n ones starting at position i
  29. How can I test whether a number is a power of 2?
  30. What is bit masking?

Leave a Comment