Invalid solution for code challenge with operator restrictions

by

The following only assumes 2’s complement with at least 16 bits:

int mask = ~0x7FFF;
return !(x&mask)|!(~x&mask);

That uses a 15-bit constant; if that is too big, you can construct it from three smaller constants, but that will push it over the 8-operator limit.

An equivalent way of writing that is:

int m = 0x7FFF;
return !(x&~m)|!~(x|m);

But it’s still 7 operations, so int m = (0x7F<<8)|0xFF; would still push it to 9. (I only added it because I don’t think I’ve ever before found a use for !~.)

More Related Contents:

  1. Weird behavior of right shift operator (1 >> 32)
  2. Determine if int is not 0 with no if statements
  3. How do you set, clear, and toggle a single bit?
  4. Best practices for circular shift (rotate) operations in C++
  5. Arithmetic bit-shift on a signed integer
  6. Why doesn’t left bit-shift, “
  7. Why does left shift operation invoke Undefined Behaviour when the left side operand has negative value?
  8. How to create a byte out of 8 bool values (and vice versa)?
  9. Examples of when a bitwise swap() is a bad idea?
  10. C/C++: Force Bit Field Order and Alignment
  11. What is the efficient way to count set bits at a position or lower?
  12. What is the idea behind ^= 32, that converts lowercase letters to upper and vice versa?
  13. Is multiplication and division using shift operators in C actually faster?
  14. Bitwise operators and “endianness”
  15. How do I set, clear, and toggle a single bit?
  16. Should I use #define, enum or const?
  17. What does the statement if (counter & (1
  18. get absolute value without using abs function nor if statement
  19. Why was 1
  20. Arithmetic right shift gives bogus result?
  21. What happens when you bit shift beyond the end of a variable?
  22. What’s the fastest way to pack 32 0/1 values into the bits of a single 32-bit variable?
  23. Efficient bitwise operations for counting bits or find the right|left most ones
  24. Is a logical right shift by a power of 2 faster in AVR?
  25. Branchless code that maps zero, negative, and positive to 0, 1, 2
  26. Fastest way to produce a mask with n ones starting at position i
  27. How to set, clear, and toggle a single bit?
  28. Fast divisibility tests (by 2,3,4,5,.., 16)?
  29. Right shift and signed integer
  30. Left bit shifting 255 (as a byte)

Leave a Comment