Bit-Fields in C - Real World Example

August 16, 2026

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...

📌 Bit-Fields in C – Real World Example

🔋 1. Embedded System: Status Flags using Bit-Fields

#include <stdio.h>

struct StatusFlags {
    unsigned int powerOn : 1;
    unsigned int error : 1;
    unsigned int batteryLow : 1;
    unsigned int reserved : 5;
};

int main() {
    struct StatusFlags device = {1, 0, 1, 0};

    printf("Power ON: %u\n", device.powerOn);
    printf("Error: %u\n", device.error);
    printf("Battery Low: %u\n", device.batteryLow);

    return 0;
}

🧠 Explanation:

struct StatusFlags uses only 8 bits (1 byte) instead of 4 bytes.
Each flag (like power, error) is a bit-field that takes just 1 bit.
Perfect for embedded systems where memory and performance are critical.

🖥️ Sample Output:

Power ON: 1
Error: 0
Battery Low: 1

🔑 Keywords:

bit field in C, struct with bit-fields, embedded systems flags, memory-efficient C code, real-world struct usage, flag register, C interview examples

Search This Blog

1PRINTF

Featured

Merge Sort in C++