# C++ program to swap adjacent bits

**Swapping of adjacent bits in C++:** Here, we are going to learn **how to swap adjacent bits of a number**?

Submitted by Saksham Bhayana, on December 12, 2018

**Problem statement:** C++ program to swap all odd bits with even bits (swap adjacent bits). Every even positiC++ program to swap all odd bits with even bits (swap adjacent bits). Every even position bit is swapped with an adjacent bit on the right side and every odd position bit is swapped with adjacent on the left side. For instance, 13(00001101) should be converted to 14(00001110) .on bit is swapped with an adjacent bit on the right side and every odd position bit is swapped with adjacent on the left side. For instance, 13(00001101) should be converted to 14(00001110).

**Input format:** The first line of input contains an integer T denoting the number of test cases. Then T test cases follow. The first line of each test case contains an unsigned integer N.

**Output format:** Corresponding to each test case, print in a new line, the converted number.

**Constraints:**

1 ≤ T ≤ 100 1 ≤ N ≤ 100

**Example:**

Input: 2 13 2 Output: Original number is : 13 Converted number is : 14 Original number is : 2 Converted number is : 1

**Explanation:**

If the original number is 13 (00001101), then bits at odd and even position are swapped in following manner.

After swapping, the bits are:

**Algorithm:**

- Create a mask to obtain the 0xAAAAAAAA to extract bits.
- Obtain the odd bits and shift these to even positions.
- Either create mask2 (0x55555555) for even bits or right shift the mask to extract it. Obtain the even bits and shift these to odd positions.
- Combine the shifted values of odd and even bits to obtain the converted number.

**Program:**

#include <iostream> using namespace std; unsigned int swap_odd_even(int num){ int mask=0xAAAAAAAA; //A in hexadecimal is equal to 10 in decimal //and 1010 in binary unsigned int oddbits = (num&mask); //right shift for even bits unsigned int evenbits = num&(mask>>1); //can also use 0x55555555 as mask for even bits return (oddbits>>1) | (evenbits<<1); } int main() { int T; //testcases cout<<"Enter total number of elements (test cases): "; cin>>T; //variable to store the number unsigned int N; for(int i=0;i<T;i++) { cout<<"Enter number: "; cin>>N; cout<<"Original number is : "<<N<<endl; cout<<"Converted number is :"<<swap_odd_even(N)<<endl; } return 0; }

**Output**

Enter total number of elements (test cases): 2 Enter number: 13 Original number is : 13 Converted number is :14 Enter number: 2 Original number is : 2 Converted number is :1

TOP Interview Coding Problems/Challenges

- Run-length encoding (find/print frequency of letters in a string)
- Sort an array of 0's, 1's and 2's in linear time complexity
- Checking Anagrams (check whether two string is anagrams or not)
- Relative sorting algorithm
- Finding subarray with given sum
- Find the level in a binary tree with given sum K
- Check whether a Binary Tree is BST (Binary Search Tree) or not
- 1[0]1 Pattern Count
- Capitalize first and last letter of each word in a line
- Print vertical sum of a binary tree
- Print Boundary Sum of a Binary Tree
- Reverse a single linked list
- Greedy Strategy to solve major algorithm problems
- Job sequencing problem
- Root to leaf Path Sum
- Exit Point in a Matrix
- Find length of loop in a linked list
- Toppers of Class
- Print All Nodes that don't have Sibling
- Transform to Sum Tree
- Shortest Source to Destination Path

Comments and Discussions

**Ad:**
Are you a blogger? Join our Blogging forum.