Skip to main content

Featured

Merge Sort in C++

  Merge Sort in C++ Introduction Merge Sort is a popular sorting algorithm that follows the Divide and Conquer approach. It divides an array into smaller subarrays, recursively sorts those subarrays, and finally merges the sorted subarrays to produce a completely sorted array. In this tutorial, we will learn how to implement Merge Sort in C++ . The program divides the array into two halves using the mid index, recursively sorts both halves, and then combines them using the merge() function. Merge Sort has a time complexity of O(n log n) in the best, average, and worst cases. Table of Contents Algorithm C++ Program Input Sample Output Output Explanation Dry Run Flow of Execution Time Complexity Space Complexity Applications Key Points Interview Questions Frequently Asked Questions Keywords Conclusion Algorithm Start the program. Read the size of the array. Read the array elements from the user. Call the mer...

Swap Nibbles of 8-bit Number in C

Swap Nibbles of 8-bit Number in C

✅ Swap Nibbles of 8-bit Number in C

#include <stdio.h>  // Header file for input/output functions

// Macro to swap the nibbles (4-bit groups) of an 8-bit number
// (x & 0x0F) extracts the lower nibble (last 4 bits)
// (x & 0xF0) extracts the upper nibble (first 4 bits)
// << 4 shifts lower nibble to upper position
// >> 4 shifts upper nibble to lower position
// The OR '|' combines both into the swapped result
#define SWAP_NIBBLES(x)  (((x & 0x0F) << 4) | ((x & 0xF0) >> 4))

int main() {
    unsigned char num;  // Declare an 8-bit unsigned variable

    printf("Enter an 8-bit number (0-255): ");  // Prompt user for input
    scanf("%hhu", &num);  // Read input as unsigned char using %hhu format specifier

    // Call the macro to swap the nibbles and store result in 'swapped'
    unsigned char swapped = SWAP_NIBBLES(num);

    // Print the result after swapping nibbles
    printf("After swapping nibbles: %u\n", swapped);

    return 0;  // Return 0 to indicate successful execution
}
  

๐Ÿ“˜ Explanation:

This program demonstrates how to swap the two 4-bit nibbles of an 8-bit number using a macro. A macro named SWAP_NIBBLES is defined to isolate the lower and upper nibbles using bitwise AND with 0x0F and 0xF0 respectively. The lower nibble is shifted left by 4 bits and the upper nibble is shifted right by 4 bits, then both are combined using the bitwise OR | operator.

The user inputs an 8-bit number (from 0 to 255), and the program displays the result after nibble swapping. This technique is useful in embedded systems, low-level data processing, and binary manipulations.

๐Ÿงพ Sample Output:

Enter an 8-bit number (0-255): 100
After swapping nibbles: 70
  

๐Ÿ”‘ Keywords:

Swap Nibbles in C, Bitwise Operations, C Macros, 8-bit Manipulation, Embedded C, Nibble Swapping, Low-level C Programming

๐Ÿ“Œ Hashtags:

#CProgramming #BitwiseOperators #MacrosInC #SwapNibbles #EmbeddedC #LowLevelCoding

Comments

Popular Posts

๐ŸŒ™