Shift right of negative numbers

Only right shift is discussed here , Shift left positive and negative numbers are the same , The lowest point is made up of 0.

In the computer , Numerical values are operated in binary form , also The operation object of bit operator is complement .

Positive numbers ： Original code = Inverse code = Complement code

negative ： Original code ----> Inverse code （ Take the opposite ） ----> Complement code （+1）

demonstration ：

• Put a positive integer 10 Move two places to the right
  Original code ：0000 0000 0000 0000 0000 0000 0000 1010

  Because it's a positive number , Therefore, the displacement can be directly operated .

  The calculation result is 0000 0000 0000 0000 0000 0000 0000 0010

  Convert to decimal , The result is ：2

• Set negative integer -10 Move two places to the right

  Original code ：1000 0000 0000 0000 0000 0000 0000 1010
  Then we have to calculate the complement ：

  1. Take the opposite , The sign bits remain the same , Do not participate in negation
     1111 1111 1111 1111 1111 1111 1111 0101
  2. +1
     1111 1111 1111 1111 1111 1111 1111 0110
  3. Displacement , Shift the highest position right to fill 1
     1111 1111 1111 1111 1111 1111 1111 1101

  Because here is the complement , The original code should be restored after the calculation , There are two forms ： Take the opposite ,+1; perhaps -1 , Take the opposite ：

  1. Take the opposite
     1000 0000 0000 0000 0000 0000 0000 0010
  2. +1
     1000 0000 0000 0000 0000 0000 0000 0011

  Convert to decimal , The result is ： -3