A nibble is a four-bit aggregation, or half an octet. There are two nibbles in a byte.
Given a byte, swap the two nibbles in it. For example 100 is be represented as 01100100 in a byte (or 8 bits). The two nibbles are (0110) and (0100). If we swap the two nibbles, we get 01000110 which is 70 in decimal.
To swap the nibbles, we can use bitwise &, bitwise ” operators. A byte can be represented using a unsigned char in C as size of char is 1 byte in a typical C compiler.
Below is the implementation of above idea.
100 is 01100100 in binary. The operation can be split mainly in two parts
1) The expression “x & 0x0F” gives us last 4 bits of x. For x = 100, the result is 00000100. Using bitwise ‘<<' operator, we shift the last four bits to the left 4 times and make the new last four bits as 0. The result after shift is 01000000.
2) The expression “x & 0xF0” gives us first four bits of x. For x = 100, the result is 01100000. Using bitwise ‘>>’ operator, we shift the digit to the right 4 times and make the first four bits as 0. The result after shift is 00000110.
At the end we use the bitwise OR ‘|’ operation of the two expressions explained above. The OR operator places first nibble to the end and last nibble to first. For x = 100, the value of (01000000) OR (00000110) gives the result 01000110 which is equal to 70 in decimal.
This article is contributed by Anuj Garg. Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.
- C Program to Swap two Numbers
- Swap every two bits in bytes
- Number of ways to swap two bit of s1 so that bitwise OR of s1 and s2 changes
- How to swap two bits in a given integer?
- How to swap two numbers without using a temporary variable?
- Swap bits in a given number
- Swap all odd and even bits
- Swap three variables without using temporary variable
- Bit manipulation | Swap Endianness of a number
- Find the two non-repeating elements in an array of repeating elements/ Unique Numbers 2
- Compute the minimum or maximum of two integers without branching
- Maximum sum such that no two elements are adjacent
- Two elements whose sum is closest to zero
- Implement two stacks in an array
- Add two numbers without using arithmetic operators
- Add two bit strings
- Russian Peasant (Multiply two numbers using bitwise operators)
- Find distance between two nodes of a Binary Tree
- Find the maximum path sum between two leaves of a binary tree
- Multiply two polynomials