asked on # sumDigits challenge

Hi,

http://codingbat.com/prob/p163932

I am working on above challenge

i was not sure how to find the sum of digits recursively without loop which i worked earlier. please advise

http://codingbat.com/prob/p163932

I am working on above challenge

Given a non-negative int n, return the sum of its digits recursively (no loops). Note that mod (%) by 10 yields the rightmost digit (126 % 10 is 6), while divide (/) by 10 removes the rightmost digit (126 / 10 is 12).

sumDigits(126) → 9

sumDigits(49) → 13

sumDigits(12) → 3

i was not sure how to find the sum of digits recursively without loop which i worked earlier. please advise

JavaJava EEProgramming Languages-OtherProgrammingProgramming Theory

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.where should i read up on it? Any best material,book, site?

You should really read up on it if you don't understand the concept. Challenges are not going to be enough.

View this solution by signing up for a free trial.

Members can start a 7-Day free trial and enjoy unlimited access to the platform.

View this solution by signing up for a free trial.

Members can start a 7-Day free trial and enjoy unlimited access to the platform.

I will try

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

above passes all test. any improvements or alternate approaches?

if (n < 10)Brilliant! I like your base case much better.

{return n;

%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:

Open in new window

RECURSIONis 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.