C Program: Print Binary Representation of a Number

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

✅ C Program: Binary Representation of a Number

#include<stdio.h>
int main( )
{
    unsigned int num;
    printf("Enter the number:\n");
    scanf("%u", &num);

    for(int i = 31; i >= 0; i--)
    {
        if(num & (1 << i))
            printf("1");
        else
            printf("0");
    }
    printf("\n");
}

📘 Explanation:

This program prints the binary representation of an unsigned integer using bitwise operators.

The user inputs a number.
The loop checks all 32 bits (from MSB to LSB).
If the bit is set, it prints 1; otherwise, 0.
This uses the expression (num & (1 << i)) to test each bit.

🧾 Sample Output:

Enter the number:
5
00000000000000000000000000000101

🔖 Keywords:

C Program, Binary in C, Bitwise Operator in C, Binary Print, 32-bit Output, C Interview Questions, Unsigned Integer Handling

📌 Hashtags:

#CProgramming #BitwiseOperators #BinaryOutput #InterviewPreparation #AdSenseReady #CodingBlog

Search This Blog

1PRINTF

Featured

Merge Sort in C++