Skip to main content

Featured

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...
Post a Comment
Read more
Labels

C program to check whether a given number is a power of 2 using bitwise operations

Check Power of 2 in C

⚡ Check If a Number Is a Power of 2

#include<stdio.h>

int power(int num)
{
    if(num > 0 && (num & (num - 1)) == 0)
    {
        return 1;
    }
    else
    {
        return 0;
    }
}

int main()
{
    int num;
    scanf("%d", &num);
    
    if(power(num))
    {
        printf("%d is a power of 2\n", num);
    }
    else
    {
        printf("%d is not a power of 2\n", num);
    }
}

📘 Explanation:

✅ The condition (num & (num - 1)) == 0 is true only if there is only one set bit in num.
✅ This logic efficiently checks whether a number is a power of 2.
✅ It excludes 0 and negative numbers.

🧪 Sample Output:

Input:
8
Output:
8 is a power of 2

🏷️ Keywords:

C program power of 2, bitwise check power of 2, efficient logic, beginner C programming, technical interview questions

Labels:

Comments

Post a Comment

Popular Posts

🌙