Check Even or Odd using Bitwise AND 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 Even or Odd Using Bitwise AND in C

#include <stdio.h>

int main() {
    int num;
    printf("Enter a number:\n");
    scanf("%d", &num);

    // Using bitwise AND operator
    if (num & 1)
        printf("%d is Odd\n", num);
    else
        printf("%d is Even\n", num);

    return 0;
}

📘 Explanation:

This C program determines whether a number is even or odd using the bitwise AND operator:

In binary, even numbers end with 0 and odd numbers end with 1.
num & 1 isolates the last bit of the number.
If the result is 1, the number is odd. If it's 0, it's even.

This method is efficient and used in low-level systems and embedded code for performance.

🧾 Sample Output:

Enter a number:
11
11 is Odd

Enter a number:
24
24 is Even

🔑 Keywords:

Bitwise AND, Even or Odd using bitwise, C program for parity check, binary logic, bitwise operators, embedded C tricks

📌 Hashtags:

#CProgramming #BitwiseOperations #EvenOddCheck #BinaryLogic #BeginnerC #EmbeddedC #CodingTricks

Search This Blog

1PRINTF

Featured

Merge Sort in C++