2015/6/10 bitwise arithmetic and complement seeking method

1. Bitwise operation

"and" Operations: two data to participate in the operation, press bits for "and" operation.    Arithmetic Rules:0&0=0;    0&1=0;     1&0=0; 1&1=1;

That is , the two-bit is "1" at the same time, the result is "1", otherwise 0

"or" Operations: two objects participating in the operation, pressing bits for "or" operations. operation rules: 0|0=0; 0|1=1; 1|0=1; 1|1=1;

That is , the two objects that participate in the operation have a value of 1 and 1.

XOR operation: two data to participate in the operation, according to Bits for "XOR" operation. operation rules: 0^0=0; 0^1=1; 1^0=1; 1^1=0;

That is: The two objects participating in the operation, if two corresponding bits are "XOR" (the value is different), then the bit result is 1, otherwise 0.

2. Complement

The complement of a positive number is the complement of its own negative number, which is the sign bit invariant and the other bits are reversed and added 1.

2015/6/10 bitwise arithmetic and complement seeking method