Recursion is a process of function calling itself.
stack data structure are used to implement the recursion.
Due to recursion code is look clean and elegent.
A complex problem is divided into small sub-problem using recursion.
Program to display number from 1 to n in reverse order-
def func(n):
if n==0:
return
print(n,end=" ")
func(n-1)
print("Enter any number")
n=int(input())
print("Numbers from 1 to "+str(n)+" in reverse order")
func(n)
Enter any number
12
Numbers from 1 to 12 in reverse order
12 11 10 9 8 7 6 5 4 3 2 1
Enter any number
100
Numbers from 1 to 100 in reverse order
100 99 98 97 96 95 94 93 92 91 90 89 88 87 86 85 84 83 82 81 80 79 78 77 76 75 74 73 72 71 70 69 68 67 66 65 64 63 62 61 60 59 58 57 56 55 54 53 52 51 50 49 48 47 46 45 44 43 42 41 40 39 38 37 36 35 34 33 32 31 30 29 28 27 26 25 24 23 22 21 20 19 18 17 16 15 14 13 12 11 10 9 8 7 6 5 4 3 2 1
In this program, firstly we take input of number then we call a function 'func()'
- inside func() function there is print statement which print number then func(n-1) is called then this process is repeat again an again until n will become zero, then func() call return and stack is become empty at last.