Right Shift (>>)

The right shift operator (>>) moves all bits to the right by a specified number of positions. Bits that fall off the right edge are discarded.

Example: $20 >> 2$. In binary, $20 = 10100$. Shifting right by 2 positions gives $101 = 5$. Shifting right by $k$ positions divides the number by $2^k$ (using integer division). Here, $20 / 2^2 = 5$.

For positive numbers, new bits on the left are filled with 0. For negative numbers, the behavior depends on the language (arithmetic shift vs logical shift), but you'll typically work with positive numbers in bit manipulation problems.