Bit operations for Java negative numbers

Tag: Take the inverse of the original code operation pre SYS complement system int negative number

/**
* Calculate the bit operation of negative number
*/
1.   -10 >> 2  =?
2.   -10 of the original code: 0000 0000 0000 0000 0000 0000 1010   Highest bit representation sign bit
3.   -10 anti-code: 1111 1111 1111 1111 1111 1111 1111 0101   symbol is unchanged, other bits opposite
4.   -10 Complement: 1111 1111 1111 1111 1111 1111 1111 0110   complement for anti-code plus 1
5. Complement right Shift 2 to: 1111 1111 1111 1111 1111 1111 1111 1101
6.  The complement is reversed: 1000 0000 0000 0000 0000 0000 0000 0010
7 Plus one original code:  0000 0000 0000 0000 0000 0000 0011    -3
System.out.println ( -10 >> 2);



-3

Bit operations for Java negative numbers