Write a value-returning recursive function that uses the DigitSum function of Exercise 1 to compute the single digit to which the int argument’s digits ultimately sum. For example, given the argument 999, the DigitSum result would be 9 + 9 + 9 = 27, but the recursive digit sum would then be 2 + 7 = 9.
Exercise 1
Write a value-returning recursive function called Digi tSum that computes the sum of the digits in a given positive int argument. For example, if the argument is 12345, then the function returns 1+2 + 3 + 4 + 5 = 15.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.