Skip to main content

Featured

C Program to Check Prime Number Using Efficient Logic

  Introduction A prime number is a number that has exactly two distinct positive divisors: 1 and itself. In this program, we check whether a given number is prime or not using a simple and efficient logic. This type of program is commonly used in mathematics, competitive programming, and basic algorithm learning for beginners in C programming. Problem Statement The task is to write a C program that determines whether a given integer is a prime number or not. The program takes a single integer input from the user and analyzes its divisibility. If the number has no divisors other than 1 and itself, it should be identified as a prime number; otherwise, it is not prime. This problem is important in number theory and has practical relevance in areas such as cryptography, data validation, and algorithm design.  Algorithm / Logic Explanation To check whether a number is prime, we need to verify that it is not divisible by any number other than 1 and itself. The algorithm follows a si...

Write a program to find the max of two numbers in c

 Description : 

You have to read two integers from user and find the maximum of two integers.

Sample Execution : 

Test case 1 : 

Enter the num1 : 10

Enter the num2 : 20 

Max of two numbers is 20

Test case 2 :

Enter the num1 : 95

Enter the num2 : 25 

Max of two numbers is 95

PROGRAM:

---------------------------------------------------------------------------------------------------------------

#include<stdio.h>

int main()

{

    int num1,num2;

      printf("Enter the num1:");

     scanf("%d",&num1);

   printf("Enter the num2:");

    scanf("%d",&num2);

   if(num1>=num2)

    {

    printf("max of two numbers is %d",num1);

    }

else if(num2>=num1)

{

printf("max of two numbers is %d",num2);

}

}

---------------------------------------------------------------------------------------------------------------

Comments

Popular Posts

🌙