**Bit shifting** is performed using *bitwise operators* to move bits to the right or to the left​. Bit shifting is helpful in low-level programming. Let's understand this concept better with the illustration below:

# Code
For these bitwise operations, we will use:
* `>>` for right-shift
* `<<` for left-shift

> Remember: These binary operators are *in-fix*.

#include <iostream>
#include <bitset>
using namespace std;

int main() {
  int a = 186; // 10111010
  // using bitset() fucntion to print 
  // in binary form
  cout << "Before shifting " << bitset<8>(a);

  // right-shift bits one time
  int b = a >> 1; 

  // pritning
  cout << "\n" << "After shifting bits once to the right " << bitset<8>(b); 
  
  // left-shift bits twice
  b = a << 2; 

  // pritning
  cout << "\n" << "After shifting bits twice to the left " << bitset<8>(b); 
  return 0;
}

class HelloWorld {
    public static void main( String args[] ) {
        int a = 170; //10101010  
  
        // Before shifting 
        System.out.println("Before shifting " + Integer.toBinaryString(a));
        // Right shifting once
        System.out.println("After shifting bits once to the right " + Integer.toBinaryString(a >> 1));
        // Left shifting twice
        System.out.println("After shifting bits twice to the left " + Integer.toBinaryString(a << 2));
    }
}

Java

a = 170 # (10101010)

# Before Shifting
print ('Before shifting ', bin(a))
# shift right operator
print ('After shifting bits once to the right ', bin(a >> 1))
# shift left operator
print ('After shifting bits twice to the left ', bin(a << 2))