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.
In left rotation, the bits that fall off at left end are put back at right end.
In right rotation, the bits that fall off at right end are put back at left end.
Let n is stored using 8 bits. Left rotation of n = 11100101 by 3 makes n = 00101111 (Left shifted by 3 and first 3 bits are put back in last ). If n is stored using 16 bits or 32 bits then left rotation of n (000…11100101) becomes 00..0011100101000.
Right rotation of n = 11100101 by 3 makes n = 10111100 (Right shifted by 3 and last 3 bits are put back in first ) if n is stored using 8 bits. If n is stored using 16 bits or 32 bits then right rotation of n (000…11100101) by 3 becomes 101000..0011100.
Left Rotation of 16 by 2 is 64 Right Rotation of 16 by 2 is 4
Please write comments if you find any bug in the above program or other ways to solve the same problem.
- Find Next Sparse Number
- Swap all odd and even bits
- Binary representation of a given number
- Find the element that appears once
- Count total set bits in all numbers from 1 to n
- Find whether a given number is a power of 4 or not
- Compute modulus division by a power-of-2-number
- Compute the minimum or maximum of two integers without branching
- Find the two non-repeating elements in an array of repeating elements
- Count number of bits to be flipped to convert A to B
- Count set bits in an integer
- Write an Efficient C Program to Reverse Bits of a Number
- Check for Integer Overflow
- Find the Number Occurring Odd Number of Times
- Position of rightmost set bit