Can this function be optimized?


int SEED = 9000;
int result = 17;
result = (SEED * result) + A;
result = (SEED * result) + B;
result = (SEED * result) + C;
return result;

->

return 9000 * (9000 * ((9000 * 17) + C) + B) + A;

Now what?

over 9000 amirite ?

>>2
Not really, it depends on the values of A,B,C...

It should be:

return S * (S * ( (S * 17) + A) + B) + C;

No amount of rearranging is going to affect how fast it actually runs. Assuming you have a decent compiler, any of the variations above will run in pretty much the same amount of time.

If you want to "optimize" the number of lines of code the section uses, then clearly you can get anywhere between one and six lines, depending on how readable you decide you want it to be.