JavaCodes/program44.c at main · raskarabhi45/JavaCodes · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
//copy of program39.c..but without flag
//Best logic of prime number
#include<stdio.h>
#include<stdbool.h>

bool CheckPrime(int iNo)
{
    int iCnt=0;
    if(iNo<0)
    {
        iNo=-iNo;
    }
    for(iCnt=2;iCnt<=iNo/2;iCnt++)
    {
        if(iNo%iCnt==0)
        {
           break;
        }
    }
    if(iCnt==(iNo/2)+1)   // logic
    {
        return true;
    }
    else{
        return false;
    }

}

int main()
{
    int iValue=0;
    bool bRet;

    printf("Enter numeber\n");
    scanf("%d",&iValue);
    bRet=CheckPrime(iValue);

    if(bRet==true)
    {
        printf("%d is prime number\n",iValue);
    }
    else{
        printf("%d is not prime number\n",iValue);
    }


}