<a href="http://g.adspeed.net/ad.php?do=clk&zid=15220&wd=468&ht=60&pair=as" target="_blank"><img style="border:0px;" src="http://g.adspeed.net/ad.php?do=img&zid=15220&wd=468&ht=60&pair=as" alt="i" width="468" height="60"/></a>
Log in
::
Register
::
Not logged in
Home
Tags
Articles
Editorials
Stairways
Forums
Scripts
Videos
Blogs
QotD
Books
Ask SSC
SQL Jobs
Training
Authors
About us
Contact us
Newsletters
Write for us
<a href="http://g.adspeed.net/ad.php?do=clk&zid=15491&wd=120&ht=300&pair=as" target="_top"><img style="border:0px;" src="http://g.adspeed.net/ad.php?do=img&zid=15491&wd=120&ht=300&pair=as" alt="i" width="120" height="300"/></a>
Recent Posts
Recent Posts
Popular Topics
Popular Topics
Home
Search
Members
Calendar
Who's On
Home
»
Article Discussions
»
Article Discussions by Author
»
Discuss content posted by Terry Steadman
»
Flexable Rate Recursion
Flexable Rate Recursion
Rate Topic
Display Mode
Topic Options
Author
Message
terrance.steadman
terrance.steadman
Posted Thursday, October 14, 2010 8:16 PM
SSC-Enthusiastic
Group: General Forum Members
Last Login: Friday, April 19, 2013 11:06 AM
Points: 174,
Visits: 423
Comments posted to this topic are about the item
Flexable Rate Recursion
Post #1004868
Ben Thul
Ben Thul
Posted Friday, October 15, 2010 9:28 AM
SSC-Enthusiastic
Group: General Forum Members
Last Login: Wednesday, May 22, 2013 12:47 PM
Points: 100,
Visits: 346
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.
Post #1005299
LauraCassidy
LauraCassidy
Posted Friday, October 15, 2010 10:15 AM
Old Hand
Group: General Forum Members
Last Login: Wednesday, February 06, 2013 6:12 PM
Points: 381,
Visits: 185
Plus you spelled flexible incorrectly.
Post #1005339
terrance.steadman
terrance.steadman
Posted Friday, October 15, 2010 10:16 AM
SSC-Enthusiastic
Group: General Forum Members
Last Login: Friday, April 19, 2013 11:06 AM
Points: 174,
Visits: 423
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.
Post #1005340
terrance.steadman
terrance.steadman
Posted Friday, October 15, 2010 10:19 AM
SSC-Enthusiastic
Group: General Forum Members
Last Login: Friday, April 19, 2013 11:06 AM
Points: 174,
Visits: 423
Greetings Laura,
Yep! My bad.
Post #1005343
« Prev Topic
|
Next Topic »
Permissions
You
cannot
post new topics.
You
cannot
post topic replies.
You
cannot
post new polls.
You
cannot
post replies to polls.
You
cannot
edit your own topics.
You
cannot
delete your own topics.
You
cannot
edit other topics.
You
cannot
delete other topics.
You
cannot
edit your own posts.
You
cannot
edit other posts.
You
cannot
delete your own posts.
You
cannot
delete other posts.
You
cannot
post events.
You
cannot
edit your own events.
You
cannot
edit other events.
You
cannot
delete your own events.
You
cannot
delete other events.
You
cannot
send private messages.
You
cannot
send emails.
You
may
read topics.
You
cannot
rate topics.
You
cannot
vote within polls.
You
cannot
upload attachments.
You
may
download attachments.
You
cannot
post HTML code.
You
cannot
edit HTML code.
You
cannot
post IFCode.
You
cannot
post JavaScript.
You
cannot
post EmotIcons.
You
cannot
post or upload images.
Copyright © 2002-2013 Simple Talk Publishing. All Rights Reserved.
Privacy Policy.
Terms of Use.
Report Abuse.
