The document describes a recursive function named add-nums that calculates the sum of integers from n down to 0. An example is provided where calling add-nums with an argument of 4 results in a sum of 10. The document includes C programming code for the function and its execution.

1. Define a recursive function named add-nums that adds up the numbers N, N-1, N-2, and so on,
down to 0, and returns the sum. (add-nums 4) should compute 4 + 3 + 2 + 1 + 0 which is 10.
Solution
#include
int add_nums(int n){
if(n == 0){
return 0;
}
else{
return n + add_nums(n - 1);
}
}
int main()
{
int result = add_nums(4);
printf("Result is %d ", result);
return 0;
}
Output:
sh-4.2$ gcc -o main
*.c
sh-4.2$
main
Result is 10