Skip to main content

Featured

C++ Program to Perform Linear Search on a Vector

  C++ Program to Perform Linear Search on a Vector Introduction In this C++ program, we will learn how to perform a Linear Search on a vector. The program first takes the size of the vector and its elements as input. Then it asks the user for the element to search. If the element is found, it displays the index where it is located. Otherwise, it displays a message indicating that the element is not found. C++ Program #include<bits/stdc++.h> using namespace std; int main() { int num, search, found = 0; cout << "Enter the size of the vector:" << endl; cin >> num; vector<int> v(num); cout << "Enter " << num << " elements in vector:" << endl; for(int i = 0; i < num; i++) { cin >> v[i]; } cout << "Enter element that you want to search:" << endl; cin >> search; for(int i = 0; i < num; i++) { ...

CHECK IF SYSTEM IS LITTLE ENDIAN OR BIG ENDIAN IN C

Check System Endianness in C

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

Comments

Popular Posts

๐ŸŒ™