/* Arithmetic shift operators: Left shift << Right shift >> Logical shift operators (unsigned): Left shift <<< Right shift >>> num= num<<1 4= 0100 << 1000 (left shift, move for one place all bits to the left. Basically we are multiplying by 2) num= num>>1 5= 0101 >> 0010 (right shift, move for one place all bits to the right. We are dividing by 2. Also notice that here we got truncation error, last bit is lost, so we end up with 2. Using float would fix it but even float has its limits.) */ public class RightLeftShift{ public static void main(String[] args){ int num= 4; num<<=1; System.out.println("num= "+num); int num1= 3; num1<<=3; System.out.println("num1= "+num1); /* 3* 2³ = 3*8 = 24 3= 0000 0011 24= 0001 1000 8bit registar */ int num2= -3; num2<<=2; System.out.println("num2= "+num2); /* -3* 2² = -3*4 = -12 -3= 1111 1101 -12= 1111 0100 */ int num3= 16; num3>>=2; System.out.println("num3= "+num3); /* 16* 2^(-2) = 16* 0.5² = 16*0.25 = 4 = 16* (1/2)² = 16/4 = 4 16= 0001 0000 4= 0000 0100 */ int num4= 14; num4>>=2; System.out.println("num4= "+num4); /* 14* 2^(-2) = 14*0.25 = 3.5 14= 0000 1110 3.5= 0000 0011.10(Truncation error) We are adding two integers,so .10 will be lost and we will get 0000 0011 = 3 */ int num5= -12; num5>>=2; System.out.println("num5= "+num5); /* -12*0.25 = -3 -12= 1111 0100 -3= 1111 1101 */ int num6= -12; num6>>>=2; System.out.println("num6= "+num6); /* This is logical shift -12= 1111 0100 0011 1101 Notice how >>> added two zeros (not 1s) on the left side! Here we used 8bit register so we get 0011 1101 = 61, in reality register has much more bits so we wll get relatively much bigger number. Run the code to see that number. */ /* So, it might occurs to you that you could use byte (because byte has 8bits) so we would get 61, right? Let's see: */ byte num7= -12; num7>>=2; System.out.println("num7= "+num7); /* We got -3. The reason why this happened is because byte is first promoted to int then right shift operator is used, after that we have typecast int to byte, where we lose all zero bits. Let's see that: -12 byte= 1111 0100 promotion to int: 1111 1111 1111 0100 logical rg.sh >>> 0011 1111 1111 1101 typecast: 1111 1101 1111 1101= -3 */ } } /* Lesson: Bitwise Right >> Left << Shift Operators Created by voja */

0️⃣1️⃣⏩ Bitwise Right >> Left << Shift Operators