Switch to full style
C code examples
Post a reply

Get factor of number using C- find a prime factor

Wed Jan 23, 2013 1:35 am

Get factor of number using C programming language, check if a number is prime or composite.
cpp code
void factor(int number, int n, int j) {
// Define integer
int i;

// 1 is not a prime number
if (n == 1) {

printf("1 is a unit\n");
return;

}



i = j;

while (i <= (int)(sqrt((double)n))) {
if (n % i == 0) {
// print a prime number i and continue search
fprintf(stdout, "%d\n", i);
factor(number, (int)(n / i), i);
return;

}

else {

i++;

}

}

// If you got this part means that n is prime number.
if (n == number)
printf("%d is prime\n", number);
else
printf("%d\n", n);

return;

}




Post a reply
  Related Posts  to : Get factor of number using C- find a prime factor
 Factor of number using C++ code     -  
 compute maximum and minimum values, also scaling factor.     -  
 code to find a number all divisors using recursion     -  
 find out the number of elements in an array of 8-bit element     -  
 Prime Palindromes     -  
 Prime Generator Algorithm     -  
 Senior Java Developer for Prime Broker Trade Capture - USA     -  
 convert integer number to octal,hexadecimal number systems     -  
 convert octal number to decimal number     -  
 convert decimal number to octal number     -  

Topic Tags

C++ Algorithms