Answer:
int digitSum(int n) {
int sum = 0;
while (n) {
sum += n % 10;
n /= 10;
}
return sum < 10 ? sum : digitSum(sum);
}
int main()
{
int n = 12345;
printf("Digit sum of %d is %d\\", n, digitSum(n));
}
Step-by-step explanation:
The recursion takes care of the repeated summing in case the sum has more than 1 digit.