Chapter 12, Problem 3TF

Base case:

In Python, when a problem gets solved without performing any recursion, this is referred as the “base case”.

• • The base case is required for all recursive algorithms since it is used to stop the algorithm calling itself when it reaches a certain condition.

Recursive case:

In Python, when a problem gets solved with recursion, it is referred as “recursive case”.

• • In this case, reduce the problem into a smaller form of the related problem.
• • The problem gets reduced for each recursive call; finally, a base case will be reached, and the recursion will end.

Example:

"""Program to calculate the factorial of a given number"""

#main function

def main():

         #initializes the variable "num"

         num = 4

         #call the "fact()" function

         #display the result

         print ('Factorial of given number: ', fact(num))

#Function definition for "fact()" using recursion

def fact(num):

         #it is the base case in the given program

         #check the value of "num"

         ...