• Status: Solved
  • Priority: Medium
  • Security: Public
  • Views: 737
  • Last Modified:

Compound interest .... !!!

hi everyone, i need help on that question ....

what is the compound interest formula if i'm using 'i' for the rate and 'n' for the numbers of years ???

i already wrote two functions but they're not working !!!!

//============================================
// First one
//========

    public float Total(float i,int n)            //Savings -> return balance after n years and i interest
    {
        for(int count=0; count<n; count++)
        {
            Balance *= Math.pow(( 1 + i ), n);
        }
        return Balance;
    }
//================

// Second one
//========

    public float Total(float i,int n)            //Savings -> return balance after n years and i interest
    {
        return Balance *= Math.pow(( 1 + i ), n);
    }
//============================
i don't know what one is the correct one .... i'm not a business major :P


and if by any chance ..... could anyone tell me how to do it in the recursive way !!!

thankz
0
hackermen5
Asked:
hackermen5
  • 5
  • 4
  • 3
  • +3
3 Solutions
 
CEHJCommented:
Out of interest (no pun intended) why would you want to do it recursively?
0
 
TimYatesCommented:
I reckon it says to as part b of the homework... ;-)
0
 
TimYatesCommented:
Compound Interest is calculated like:

public calculateCompoundInterest( double rate, double period )
{
    balance = balance * Math.pow( 1+rate, period ) - balance ;
}

Make sure your "balance" variable is a double...(not an int)

Tim
0
VIDEO: THE CONCERTO CLOUD FOR HEALTHCARE

Modern healthcare requires a modern cloud. View this brief video to understand how the Concerto Cloud for Healthcare can help your organization.

 
CEHJCommented:
Tell your teacher that recursion should be avoided where it's not necessary (as it is not here;-))

The formula for simple interest is:   F  =  P ( 1 + R / N ) ^ ( N * T )

             Where :  F   =  final amount
                           P   =  initial amount
                           R   = interest rate
                           N   = number of compounding periods
                           T   = Time ( in years )

0
 
Mayank SAssociate Director - Product EngineeringCommented:
More importantly, the recursive function that he's written will go on looping forever as there's no stopping condition.

BTW, hackermen5, this is not a place to tell you the correct formula :-) we can help you with the coding/ implementation if you face problems.

I guess he needs recursion in computing the value of (1 + R/N) ^ T.... (for computing the exponential value). Strange way.

Mayank.
0
 
TimYatesCommented:
>  More importantly, the recursive function that he's written will go on looping forever as there's no stopping condition.

Which one do you think is recursive?
0
 
TimYatesCommented:
;-)
0
 
Mayank SAssociate Director - Product EngineeringCommented:
public float Total(float i,int n)            //Savings -> return balance after n years and i interest
    {
        return Balance *= Math.pow(( 1 + i ), n);
    }
//============================

Sorry, I thought I saw a call to Total () instead of pow :-) didn't read it completely.... thought that the first was non-recursive and the second recursive.

Anyways, he's still not told us why he needs the recursion.
0
 
DanninCommented:
     public float Total(float i,int n)  
      {
          float balance=0;
          for(int count=0; count<n; count++)
          {

                  balance*= Math.pow(( 1 + i ), n);
          }
          return balance;
      }
0
 
Mayank SAssociate Director - Product EngineeringCommented:
Dannin, your balance will always remain zero.
0
 
Mayank SAssociate Director - Product EngineeringCommented:
Also, by the way, why is balance supposed to multiplied by (( 1 + i ) ^ n) 'n' number of times?
0
 
DanninCommented:
Opps I'm too used to addition lol

    public float Total(float i,int n)  
     {
         float balance=1;
         for(int count=0; count<n; count++)
         {

               balance*= Math.pow(( 1 + i ), n);
         }
         return balance;
     }
Here u go
0
 
DanninCommented:
Well isn't it the way the person who asked the question wanted it?
0
 
objectsCommented:
> Tell your teacher that recursion should be avoided

except if you're learing about recursion :)
0
 
CEHJCommented:
Then an example that needs recursion should be given
0
 
objectsCommented:
An (familiar) problem that can be solved with recursion is just as suitable.
0
 
hackermen5Author Commented:
i'm sorry uys ... but my teaher is not that nice to give us an example of recursion .... i didn't even understand the recursion concept yet .....

anyway ..... thanks for ur help guys .....
0
 
Mayank SAssociate Director - Product EngineeringCommented:
By the way, why did you accept my comment as an assist? (I was still waiting to assist after getting some comments from you :-) )
0

Featured Post

Free Tool: Path Explorer

An intuitive utility to help find the CSS path to UI elements on a webpage. These paths are used frequently in a variety of front-end development and QA automation tasks.

One of a set of tools we're offering as a way of saying thank you for being a part of the community.

  • 5
  • 4
  • 3
  • +3
Tackle projects and never again get stuck behind a technical roadblock.
Join Now