logo CodeStepByStep logo


Language/Type: Python recursion return
Author: Eric Roberts (on 2017/07/08)

Write a recursive function named digit_sum that accepts an integer as a parameter and returns the sum of its digits. For example, calling digit_sum(1729) should return 1 + 7 + 2 + 9, which is 19. If the number is negative, return the negation of the value. For example, calling digit_sum(-1729) should return -19.

Constraints: Do not declare any global variables. Do not use any loops you must use recursion. Do not use any auxiliary data structures like list, dict, set, etc. Also do not solve this problem using a string. You can declare as many primitive variables like ints as you like. You are allowed to define other "helper" functions if you like they are subject to these same constraints.

Function: Write a Python function as described, not a complete program.

You must log in before you can solve this problem.

Log In

Need help?

Stuck on an exercise? Contact your TA or instructor.

If something seems wrong with our site, please

Is there a problem? Contact us.