prime.c File Reference

Program to identify if a number is prime number or not. More...

#include <assert.h>
#include <math.h>
#include <stdbool.h>
#include <stdio.h>

Include dependency graph for prime.c:

Functions
bool	isPrime (int x)
	Check if a given number is prime number or not. More...
void	test ()
	Test function. More...
int	main ()
	Driver Code. More...

Detailed Description

Program to identify if a number is prime number or not.

Function Documentation

isPrime()

bool isPrime

(

int

x

)

Check if a given number is prime number or not.

Parameters

x	number to check

Returns

true if given number is prime number, otherwise false

{
    if (x == 2)
    {
        return true;
    }
    if (x < 2 || x % 2 == 0)
    {
        return false;
    }
 
    double squareRoot = sqrt(x);
 
    for (int i = 3; i <= squareRoot; i += 2)
    {
        if (x % i == 0)
        {
            return false;
        }
    }
    return true;
}

main()

int main

(

void

)

Driver Code.

Returns

None

{
    test();
    return 0;
}

Here is the call graph for this function:

test()

void test

(

void

)

Test function.

Returns

void

{
    /* all the prime numbers less than 100 */
    int primers[] = {2,  3,  5,  7,  11, 13, 17, 19, 23, 29, 31, 37, 41,
                     43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97};
    for (size_t i = 0, size = sizeof(primers) / sizeof(primers[0]); i < size;
         ++i)
    {
        assert(isPrime(primers[i]));
    }
 
    /* Example Non-prime numbers */
    int NonPrimers[] = {-1, 0, 1, 4, 6, 8, 9, 10};
    for (size_t i = 0, size = sizeof(NonPrimers) / sizeof(NonPrimers[0]);
         i < size; ++i)
    {
        assert(!isPrime(NonPrimers[i]));
    }
}

Here is the call graph for this function: