Moves all bits to right. Bits that are lost are lost for good

1011 >> 2 = 10

a >> n is equivalent to a * (1/2)

Unsigned shifts

  • The left bits are filled with zeros.
1001 >> 1 = 0100

Signed shifts

  • implementation defined It can either:
  1. Fill all with MSB
101011 >> 2 = 111010 
  1. Fill all with 0
101011 >> 2 = 001010 

For positive values, a signed shift will be same as a unsigned shift.