Posted by: Sourav | August 1, 2014

Prime factors of a number using recursion in C


 

#include<stdio.h>
void prime(int);
void main()
{
  prime(12);

}

void prime(int i)
{
 static int j=2;
 printf(“i is %d”,i);
 getch();
 if(j<=i)
 {
 if((i%j)==0)
 {
  printf(“\nprime factor = %d”,j);
  i=i/j;
 }
 else
 {
  j++;
 }
 
 prime(i);
 
 }
 
 
}

Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s

Categories

%d bloggers like this: