Rotate bits of a number | GeeksforGeeks

Bit Rotation: A rotation (or circular shift) is an operation similar to shift except that the bits that fall off at one end are put back to the other end.

int leftRotate(int n, unsigned int d)

{

   /* In n<<d, last d bits are 0. To put first 3 bits of n at

     last, do bitwise or of n<<d with n >>(INT_BITS - d) */

   return (n << d)|(n >> (INT_BITS - d));

}

/*Function to right rotate n by d bits*/

int rightRotate(int n, unsigned int d)

{

   /* In n>>d, first d bits are 0. To put last 3 bits of at

     first, do bitwise or of n>>d with n <<(INT_BITS - d) */

   return (n >> d)|(n << (INT_BITS - d));

}

Read full article from Rotate bits of a number | GeeksforGeeks