CHECK IF SYSTEM IS LITTLE ENDIAN OR BIG ENDIAN IN C

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

✅ CHECK SYSTEM ENDIANNESS IN C

#include <stdio.h>

int main() {
    int x = 0x12AB6578;
    char *ptr = (char *)&x;

    if (*ptr == 0x78) {
        printf("System is Little Endian:\n");
    } else {
        printf("System is Big Endian:\n");
    }

    return 0;
}

🧠 Explanation:

This program determines the endianness of the system.

A hexadecimal number is stored in memory: 0x12AB6578.
The memory address of x is typecast to a char*, pointing to the least significant byte.
If the first byte contains 0x78, the system is Little Endian (least significant byte stored first).
Otherwise, the system is Big Endian.

🖥️ Sample Output:

System is Little Endian:

🔑 Keywords:

C program to check endianness, little endian vs big endian, pointer typecasting in C, memory representation in C, system architecture test.

Search This Blog

1PRINTF

Featured

Merge Sort in C++