bitshift c

1i = 14; // Bit pattern 00001110
2j = i >> 1; // here we have the bit pattern shifted by 1 thus we get 00000111 = 7 which is 14/2
3

1int i = 7;    // Decimal 7 is Binary (2^2) + (2^1) + (2^0) = 0000 0111
2int j = 3;    // Decimal 3 is Binary         (2^1) + (2^0) = 0000 0011
3k = (i << j); // Left shift operation multiplies the value by 2 to the power of j in decimal
4              // Equivalent to adding j zeros to the binary representation of i
5              // 56 = 7 * 2^3
6              // 0011 1000 = 0000 0111 << 0000 0011
7

1// 5: 0...0101
2int a = 5;
3//shift int a 2 bits
4int n = (a >> 2);