CHECK IF SYSTEM IS LITTLE ENDIAN OR BIG ENDIAN IN C

January 03, 2026

C Program to Check Prime Number Using Efficient Logic

Introduction A prime number is a number that has exactly two distinct positive divisors: 1 and itself. In this program, we check whether a given number is prime or not using a simple and efficient logic. This type of program is commonly used in mathematics, competitive programming, and basic algorithm learning for beginners in C programming. Problem Statement The task is to write a C program that determines whether a given integer is a prime number or not. The program takes a single integer input from the user and analyzes its divisibility. If the number has no divisors other than 1 and itself, it should be identified as a prime number; otherwise, it is not prime. This problem is important in number theory and has practical relevance in areas such as cryptography, data validation, and algorithm design. Algorithm / Logic Explanation To check whether a number is prime, we need to verify that it is not divisible by any number other than 1 and itself. The algorithm follows a si...

✅ 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

C Program to Check Prime Number Using Efficient Logic