Write a program to find sum of each digit in the given number using recursion.

Description:

Below example shows how to find out sum of each digit in the given number using recursion logic. For example, if the number is 259, then the sum should be 2+5+9 = 16.

Code:

? 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 package com.govindsblog.algos;   public class MyNumberSumRec {       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[]){         MyNumberSumRec mns = new MyNumberSumRec();         System.out.println("Sum is: "+mns.getNumberSum(223));     } }

Output:

Sum is: 7