C++ Program to Rotate bits of a number Last Updated : 17 Aug, 2023 Summarize Comments Improve Suggest changes Share Like Article Like Report 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. Recommended: Please try your approach on PRACTICE first, before moving on to the solution. Example: 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. C++ // C++ code to rotate bits // of number #include <bits/stdc++.h> using namespace std; #define INT_BITS 32 class gfg { /*Function to left rotate n by d bits*/ public: 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)); } }; /* Driver code*/ int main() { gfg g; int n = 16; int d = 2; cout << "Left Rotation of " << n << " by " << d << " is "; cout << g.leftRotate(n, d); cout << "\nRight Rotation of " << n << " by " << d << " is "; cout << g.rightRotate(n, d); } // This code is contributed by SoM15242 OutputLeft Rotation of 16 by 2 is 64 Right Rotation of 16 by 2 is 4 Time Complexity: O(1)Auxiliary Space: O(1) Please refer complete article on Rotate bits of a number for more details! Comment More infoAdvertise with us Next Article C++ Program to Rotate bits of a number K kartik Follow Improve Article Tags : C++ rotation Practice Tags : CPP Similar Reads Rotate bits of a number Given a 32-bit integer n and an integer d, rotate the binary representation of n by d positions in both left and right directions. After each rotation, convert the result back to its decimal representation and return both values in an array as [left rotation, right rotation].Note: A rotation (or cir 7 min read Rotate digits of a given number by K Given two integers N and K, the task is to rotate the digits of N by K. If K is a positive integer, left rotate its digits. Otherwise, right rotate its digits. Examples: Input: N = 12345, K = 2Output: 34512 Explanation: Left rotating N(= 12345) by K(= 2) modifies N to 34512. Therefore, the required 10 min read Check if two numbers are bit rotations of each other or not Given two positive integers x and y (0 < x, y < 2^32), check if one integer is obtained by rotating bits of the other. Bit Rotation: A rotation (or circular shift) is an operation similar to a shift except that the bits that fall off at one end are put back to the other end. Examples: Input : 6 min read C++ Program for Bitonic Sort Bitonic Sequence: A sequence is called Bitonic if it is first increasing, then decreasing. In other words, an array arr[0..n-i] is Bitonic if there exists an index i where 0<=i<=n-1 such that x0 <= x1 â¦..<= xi and xi >= xi+1â¦.. >= xn-1 A sequence, sorted in increasing order is cons 4 min read Javascript Program to Check if two numbers are bit rotations of each other or not Given two positive integers x and y (0 < x, y < 2^32), check if one integer is obtained by rotating bits of the other. Bit Rotation: A rotation (or circular shift) is an operation similar to a shift except that the bits that fall off at one end are put back to the other end.Examples: Input : a 3 min read Like