sumDigits challenge

Do you remember how to break up an integer into the LAST digit and the REST using % and / .

Recursion works by letting a function call itself multiple times, each time with a smaller or simpler argument.

The pseudo code would be something like:

function sumDigits( n)
sum = 0
if arg = 0 
     return sum
else
     sum = sum + LAST( arg) + sumDigits( REST( arg))

Select allOpen in new window

RECURSION is probably the single most important and elegant topic in computer science.
You should really read up on it if you don't understand the concept.  Challenges are not going to be enough.

Do you remember how to break up an integer into the LAST digit and the REST using % and / .

yes

RECURSION is probably the single most important and elegant topic in computer science.
You should really read up on it if you don't understand the concept.  Challenges are not going to be enough.

where should i read up on it? Any best material,book, site?

I will try

public int sumDigits(int n) {
  if (n < 10) 
{return n;
}
  return (n % 10) + sumDigits(n/10);
}

Select allOpen in new window

above passes all test. any improvements or alternate approaches?

 if (n < 10)
{return n;

Brilliant! I like your base case much better.