Misc

variable upto which prime numbers are to be found out More...

Functions
void	prime (int *p)
	Prime Sieve works in O(nlogn) time.
int	count (int *arr, const int size)
	Count func counts the number of prime numbers.
static void	test ()
	Test implementations.
int	main (int argc, const char *argv[])
	Main function.

Detailed Description

variable upto which prime numbers are to be found out

Function Documentation

count()

int count	(	int *	arr,
		const int	size
	)

Count func counts the number of prime numbers.

Parameters

arr	contains the prime numbers
size	denotes upto which prime numbers are to be found out

Returns

count of prime numbers

                                   {
  int k=0;
  for(int i=0;i<=size;i++){
    if(arr[i]==1){
      k++;
    }
  }
  return k;
}

main()

int main	(	int	argc,
		const char *	argv[]
	)

Main function.

Parameters

argc	commandline argument count (ignored)
argv	commandline array of arguments (ignored)

Returns

0 on exit

{
    test(); // execute the tests
    return 0;
}

Here is the call graph for this function:

prime()

void prime

(

int *

p

)

Prime Sieve works in O(nlogn) time.

Parameters

p	array to be updated

Returns

void

{
    for(long long int i=3;i<=MAX_SIZE;i+=2) { p[i]=1; }
    for(long long int i=3;i<=MAX_SIZE;i+=2)
    {
        if(p[i]==1) {
            for(long long int j=i*i;j<=MAX_SIZE;j+=i) {
            p[j]=0;
            }
        }
    }
    p[2]=1;
    p[0]=p[1]=0;    
}

test()

static void test ( void  )

static

Test implementations.

Returns

void

{
    // Test Case 1
    const int size = 10; /* array size */
    printf("Test Case 1...");
    int arr[1000005]={0};   /* array to store prime numbers */
    prime(arr);
    assert(count(arr,size)==4);
    printf("Passed\n");
}

Here is the call graph for this function: