C Programming – XOR Bitwise Operation

by

XOR operator (also called “logical addition”) is defined like this:

a   b   a^b
-----------
0   0    0
0   1    1
1   0    1
1   1    0

So a^0 leaves a intact while a^1 toggles it.

For multiple-bit values, the operation is performed bitwise, i.e. between corresponding bits of the operands.

More Related Contents:

  1. What is the fastest/most efficient way to find the highest set bit (msb) in an integer in C?
  2. Efficient Algorithm for Bit Reversal (from MSB->LSB to LSB->MSB) in C
  3. Arithmetic bit-shift on a signed integer
  4. Are the shift operators () arithmetic or logical in C?
  5. How can I multiply and divide using only bit shifting and adding?
  6. What is CHAR_BIT?
  7. Fast computing of log2 for 64-bit integers
  8. Bitfield manipulation in C
  9. Fastest way to clamp a real (fixed/floating point) value?
  10. What’s bad about shifting a 32-bit variable 32 bits?
  11. Casting float to int (bitwise) in C
  12. What does the statement if (counter & (1
  13. Compute fast log base 2 ceiling
  14. Finding consecutive bit string of 1 or 0
  15. warning: left shift count >= width of type
  16. set the m-bit to n-bit [closed]
  17. Bitshift and integer promotion?
  18. Unexpected C/C++ bitwise shift operators outcome
  19. Encoding int value as an IEEE-754 float (binary32)
  20. C reverse bits in unsigned integer
  21. How to define and work with an array of bits in C?
  22. Implementing Logical Right Shift in C
  23. Algorithm to generate bit mask
  24. Check if a number is non zero using bitwise operators in C
  25. How to replace bits in a bitfield without affecting other bits using C
  26. Decimal to Binary
  27. Bitwise shifting array of char’s
  28. How to decrypt simple XOR encryption
  29. How to implement Bitcount using only Bitwise operators?
  30. What is bit masking?

Leave a Comment