The binary right shift operator is a computer programming operator that shifts all the bits in a number to the right.
A binary number can be represented as:
The binary right shift operator would convert this number to:
The least-significant bit is lost when shifting right with a logical right shift, and a 0 is added on the other end. A single logical right shift splits a positive number by two, removing all remainders.
The bitwise shift operators shift a binary object's bit values. The value to be shifted is specified by the left operand. The right operand defines how many positions the bits in the value should be moved to. The outcome isn't a lvalue. Both operands have the same precedence and are associative from left to right.
The Right shift operator, like the Left shift operator, requires two operands to shift the bits on the right side and then insert zeroes into the empty space formed on the left side once the bits have been shifted.
The number on the left of the operator is shifted by the number to the right by the specified number of places. Because each shift to the left doubles the number, each shift to the left multiplies the original number by two. Left shift can be used for quick multiplication or to compress a bunch of numbers into a single larger value.