# sum of digits of a number using recursion in python

\\$\endgroup\\$ – TheBlackCat Jul 1 '16 at 15:05. Here, we define a recursive function sum() that takes an argument which is an integer number. In this tutorial, we will discuss a concept of the Python program to find sum of two numbers using recursion. 2. The program extracts the last digit from the number and adds it to a variable. This is a very simple and one-liner solution. Sum of digits of given Number Using Recursion is:34 Program in Python Here is the source code of the Python Program to Find the sum of digits of a number using recursion. Using recursion. def getSum(iterable): if not iterable: return 0 # End of recursion else: return iterable + getSum(iterable[1:]) # Recursion step But you shouldn't use recursion in real production code. Contribute your code and comments through Disqus. In this article, we are going to learn how to find the addition of two numbers using recursion in the Python … Many times, in interviews, you will ask to write your own Python program to calculate the sum of all the elements using recursion. myList=[23,4,2,6,7] print(sum(myList)) Output: 42. How to Find Sum of Natural Numbers Using Recursion in Python? Previous: Write a Python program to solve the Fibonacci sequence using recursion. 1234 => 2 + 4 4567 => 4 + 6 Example: How to find Next: Write a Python program to calculate the sum of the positive integers of n+(n-2)+(n-4)... (until n-x =< 0). Let Number = 8941, Sum of digits in 8941 = Sum of digits in 894 + 1, Similarly, the Sum of digits in 894 = Sum of digits in 89 + 4, and so on… As you can see we can divide a bigger problem into smaller subproblems, so recursion. Here is my code that finds the number of digits in a given integer (either positive or negative). In this Python program, we read number from user and then pass this number to recursive function reverse(). This Python program finds reverse of a given integer number using recursion. It's not efficient and the code much less clear then with using built-ins. You can not use any built-in function. Here function reverse() is recursive because it call itself. He is not interested in the sum of the digits only in the number of digits. The base condition for recursion is defined and if the input number is less than or equals to 1, the number is returned, else we return the same function call with number decremented by 1. For this case you do not need neither recursion nor loop. If you know the sum() function. The Sum of digits using recursion is the fourth program in our recursion series. Python Server Side Programming Programming If a function calls itself, it is called a recursive function. In this program, you will learn how to find the sum of even digits of a number using recursion in Python. This program can be implemented using a loop as well as recursion. This is exactly what we are doing in our code. Steps in detail: Step 1: The recursion call will look like something this, digit_sum(number). This example follows the logic that the sum of all the digits of a number 1234 will be 4 + sum of all the digits of the number 123 and again be applying the same logic on 123, it will become 4 + 3 + sum of all the digits of the number 12 then 4 + 3 + 2 + sum of all the digits of the number 1 and finally 4 + 3 + 2 + 1.. ... Guido has explicitly rejected adding tail recursion to Python. Python program to find the sum of two numbers using recursion.