Flexable Rate Recursion

Question

Flexable Rate Recursion

terrance.steadman

SSCrazy

Points: 2097
More actions
October 14, 2010 at 8:16 pm

#229650

Comments posted to this topic are about the item Flexable Rate Recursion

Viewing 7 posts - 1 through 6 (of 6 total)

You must be logged in to reply to this topic. Login to reply

Ben Thul SSChasing Mays Points: 638 More actions · Answer 1

Perhaps I'm missing something, but couldn't this be solved with some math? That is, if I have a rate to be applied a certain number of times, then I use p*(r**n) (i.e. r raised to the n power), where p is the principal, r is the rate, and n is the number of times to apply that rate.

LauraCassidy Old Hand Points: 389 More actions · Answer 2

LauraCassidy

Old Hand

Points: 389

October 15, 2010 at 10:15 am

#1237672

Plus you spelled flexible incorrectly.

terrance.steadman SSCrazy Points: 2097 More actions · Answer 3

Greetings Ben,

Yes, you are correct. However, I did not know that algorithm so I could not apply it. Instead I came up with a different solution. Your way would definitely work faster too as it requires less steps to be applied, even if it was kept in the function so it could include the error checking.