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.
Write a function to rotate bits.
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.
Write a function to rotate bits.
Left Rotation: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)
ReplyDeleteRight Rotation: 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)
#include < stdio.h >
#define INT_BITS 32
int leftRotate(int n, unsigned int d)
{
return (n << d)|(n >> (INT_BITS - d));
}
int rightRotate(int n, unsigned int d)
{
return (n >> d)|(n << (INT_BITS - d));
}
int main()
{
int n = 16;
int d = 2;
printf("Left Rotation of %d by %d is ", n, d);
printf("%d", leftRotate(n, d));
printf("\nRight Rotation of %d by %d is ", n, d);
printf("%d", rightRotate(n, d));
getchar();
}
Example:--
ReplyDeleteLet 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.