Question: for Racket language Write a structurally recursive function (digit-sum n) that takes one argument, a non-negative integer n. Think of n in terms of its
for Racket language
Write a structurally recursive function (digit-sum n) that takes one argument, a non-negative integer n. Think of n in terms of its digits using the BNF description given above. digit-sum returns the sum of the digits in n. For example:
> (digit-sum 1984) 22 > (digit-sum 47) 11 > (digit-sum (expt 18 6)) ; 34012224 18
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
