Find sum of each digit in the given number using recursion

Description:

Find sum of each digit in the given number using recursion

Code:

package com.techonol.algos;

public class SumNumber {

	int sum = 0;

	public int getNumberSum(int number) {

		if (number == 0) {
			return sum;
		} else {
			sum += (number % 10);
			getNumberSum(number / 10);
		}
		return sum;
	}

	public static void main(String a[]) {
		SumNumber sn = new SumNumber();
		System.out.println("Sum of digits are: " + sn.getNumberSum(123));
	}
}

Output:

Sum of digits are: 6

<< Previous Program | Next Program >>