- #1
courtrigrad
- 1,236
- 2
Hello all
If we want to write a recursive method that multiplies two positive integers using repeated additions, we know that: [tex] a\times b = a + (a\times(b-1)) [/tex] Would this be correct:
Also if you had:
How would you find the output when a 3 is passed? I got a bumch of hellos and goodbyes, but I got it wrong
Thanks
If we want to write a recursive method that multiplies two positive integers using repeated additions, we know that: [tex] a\times b = a + (a\times(b-1)) [/tex] Would this be correct:
Code:
// pre: a and b are positive
// post: returning the product of a and b.
public int mult(int a, int b )
a*b = a +(a * (b-1))
if( b ==1)
return(a);
else
return mult(a + a*(b-1)))
Also if you had:
Code:
public void hello(int n )
{
System.out.println("hello n = ",n);
if(n > 1)
hello(n-1);
System.out.println("goodbye n = ", n);
How would you find the output when a 3 is passed? I got a bumch of hellos and goodbyes, but I got it wrong
Thanks