DaniWeb Forum Index > Software Development > C++

C++ Factorization

Please support our C++ advertiser: Intel Parallel Studio Home

•

Join Date: Feb 2009

Posts: 1

Reputation: nparrish15 is an unknown quantity at this point

Solved Threads: 0

nparrish15 nparrish15 is offline

Offline

Newbie Poster

C++ Factorization

Feb 20th, 2009

I've been working on a program and have hit a roadblock. I know conceptually what to do, but I'm having trouble implimenting it.
Ok, so what it's suppose to do is take them randomly generated numbers that have been put in arrayints and factor them. This right now for an example if the number is 100 it will print out: 2 * 50 4 * 25 5 * 20 10 * 10 1 * 100. What I want it to print out is: 2 * 2 * 5 * 5 (doesn't have to be in that order I guess) but I'm having trouble with this. It's probably something simple that I'm overlooking but if anybody could help with it that would be great. Thanks!
Conceptually, I know I need to take the number I get from the if((arrayints[i] % j) == 0 && arrayints[i] != j) and run it back through here. Ex. 100, you would get factor1 = 2, and factor2 = 50, so I need to somehow run factor2 back through the if statement without incrementing j. (hopefully you understand what I mean lol)

 Help with Code Tags 
 c++ Syntax (Toggle Plain Text) 
for (int i = 0; i < integerIn; i++)
{
cout << "The factors for " << arrayints[i] << " are: ";
for (int j = 2; j <= floor (sqrt((double)integerIn)); j++)
{
if ((arrayints[i] % j) == 0 && arrayints[i] != j)
{
factor1 = j;
factor2 = arrayints[i]/j;
cout << factor1 << " * " << factor2 << " ";
}
}
factor1 = 1;
factor2 = arrayints[i];
cout << factor1 << " * " << factor2 <<endl;
}
for (int i = 0; i < integerIn; i++)
{
cout << "The factors for " << arrayints[i] << " are: ";
for (int j = 2; j <= floor (sqrt((double)integerIn)); j++)
{
if ((arrayints[i] % j) == 0 && arrayints[i] != j)
{
factor1 = j;
factor2 = arrayints[i]/j;
cout << factor1 << " * " << factor2 << " ";
}
}
factor1 = 1;
factor2 = arrayints[i];
cout << factor1 << " * " << factor2 <<endl;
}

•

Join Date: May 2006

Posts: 3,127

Reputation: WaltP has much to be proud of

Solved Threads: 283

WaltP

Offline

Posting Sensei

Re: C++ Factorization

Feb 21st, 2009

First, please learn to Format your code so we can read it easier.

You need to store each factor in an array as you generate them. Using your 100, you first generate 2. Save it in the array and you have 50 left. Run the loop again on the 50 and you'll get 2 again. Store it with the other 2. You have 25 left. Again and you'll get the 5. Store it. You loop on the 5 and discover it can't be reduced. Store it with the rest then output the array.

The 3 Laws of the Procrastination Society:
1) Never do today that which can be put off until tomorrow
2) Tomorrow never comes

•

Join Date: Oct 2008

Posts: 46

Reputation: zalezog is an unknown quantity at this point

Solved Threads: 11

zalezog

Offline

Light Poster

Re: C++ Factorization

Feb 21st, 2009

First,for a a number in an array call it as

Help with Code Tags

C++ Syntax (Toggle Plain Text)

 int num;

 Help with Code Tags 
 c Syntax (Toggle Plain Text) 
//Your expression for evaluating control variable 
//certainly doesn't give all the factors,referring to
//for (int j = 2; j <= floor (sqrt((double)integerIn)); j++)
//try for integerIn=999;
//999's square root lying between 31 and 32 while one of its prime
//factors(read major) being '37'
//999 = 3*3 *3 *37
//Doesn't mean mine is the fastest(just works)
//Store the factors if its required
 
 for (int j=2 ; j<= num; j++)
{ //Just as WaltP suggested go on dividing unless you 
   //get a prime number
  while (num % j==0)
    {
      cout <<num;
      num/=j ;
    }
}
//Your expression for evaluating control variable 
//certainly doesn't give all the factors,referring to
//for (int j = 2; j <= floor (sqrt((double)integerIn)); j++)
//try for integerIn=999;
//999's square root lying between 31 and 32 while one of its prime
//factors(read major) being '37'
//999 = 3*3 *3 *37
//Doesn't mean mine is the fastest(just works)
//Store the factors if its required

 for (int j=2 ; j<= num; j++)
{ //Just as WaltP suggested go on dividing unless you 
   //get a prime number
  while (num % j==0)
    {
      cout <<num;
      num/=j ;
    }
}

Last edited by zalezog; Feb 21st, 2009 at 1:38 pm.

•

Join Date: Oct 2007

Posts: 794

Reputation: siddhant3s has much to be proud of

Solved Threads: 135

siddhant3s siddhant3s is offline

Offline

Master Poster

Re: C++ Factorization

Feb 22nd, 2009

You want to actually find out the PRIME factors i.e. expand the number as the product of prime numbers(2,3,5,7...)
So the easiest way would be what has been told by WaltP.