Check if a Number is Divisible by 2 and 3 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 IF A NUMBER IS DIVISIBLE BY 2 AND 3 IN C

#include <stdio.h>

int main() {
    int num;

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

    if (num % 2 == 0 && num % 3 == 0) {
        printf("%d is perfectly divisible by both 2 and 3.\n", num);
    } else {
        printf("%d is NOT divisible by both 2 and 3.\n", num);
    }

    return 0;
}

🧠 Explanation:

This program checks whether a given number is divisible by both 2 and 3.

It uses num % 2 == 0 to check divisibility by 2.
And num % 3 == 0 to check divisibility by 3.
If both are true, it prints that the number is divisible by both.

🖥️ Sample Output:

Enter a number:
12
12 is perfectly divisible by both 2 and 3.

🔑 Keywords:

C program to check divisibility, modulus operator, if condition, logical AND, basic C program.

Search This Blog

1PRINTF

Featured

Merge Sort in C++