Scribd
Upload
51 views12 pages

Recursion: Intro, Recursive Functions Recursion Vs Iteration

This document discusses recursion, which refers to a programming technique where a function calls itself directly or indirectly. It provides examples of direct and indirect recursion. To make recursion usable, it is necessary to introduce a base case to make the recursion finite. The base case provides the exit condition from the recursive calls by using a case whose result is already known. Recursion can provide a more elegant definition of some functions compared to iteration but uses more memory due to allocating new memory for each recursive call. Whether to use recursion or iteration depends on whether code length/clarity or time/efficiency is more important for the problem.

Uploaded by

Sourabh Shekhar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
51 views12 pages

Recursion: Intro, Recursive Functions Recursion Vs Iteration

This document discusses recursion, which refers to a programming technique where a function calls itself directly or indirectly. It provides examples of direct and indirect recursion. To make recursion usable, it is necessary to introduce a base case to make the recursion finite. The base case provides the exit condition from the recursive calls by using a case whose result is already known. Recursion can provide a more elegant definition of some functions compared to iteration but uses more memory due to allocating new memory for each recursive call. Whether to use recursion or iteration depends on whether code length/clarity or time/efficiency is more important for the problem.

Uploaded by

Sourabh Shekhar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 12

Recursion

Intro, Recursive functions


Recursion vs Iteration

-> By Apni Kaksha <-


Recursion
A function can call other functions.

But a function calling itself seems logically wrong.

Recursion refers to a programming technique in which a function calls itself


directly or indirectly.
Direct/Indirect Recursions
def A( ):
B( )
def A( ):
A( ) def B( ):
A( )
Direct Indirect
Calling Itself Calling Itself
Recursive Function

def func1( ) :
print( ‘Hello World’ )
func1( )

This is a recursive function calling itself.


Recursion is Infinite...
To make it usable we need to make it finite.
We will make a case which will break the recursion.

def a(i):
if(i>0):
print(i)
Recursive Condition
i=i-1
a(i)
else: Exit Condition
return
Base Case
We make a case whose result is already known. We use this case as the exit
case.

e.g. recursive code for factorial.


factorial(1) = 1 We know it already.

BASE CASE
Recursive Definition
Function to compute : an
Iterative definition : an = a * a * a . . . a

Recursive definition : an = a * an-1

Further an-1 = a * an-2


Practice Time
Q1. Find the output: Q2. Find the output:
def binod(n): def val(n):
if n==0: if(n<=1):
print(‘Finally’) return True
else: elif(n%2==0):
print(n) return val(n/2)
binod(n-3) else:
binod(15) return val(n/1)
Recursion vs Iteration
Recursion & Loops are related, one thing can be done by both methods.
Sometimes Recursion is better, sometimes loop is better.

When a loop runs, it repeats the same variables


and the same unit of code.

In Recursion for each recursive call, new memory


is allocated for the function.
Important Points
● Recursion makes a program look shorter and easily
understandable in terms of mathematics also.
● Recursion is heavy on memory due to allocation of new memory
with each recursive call.
● When the code length & complexity matters, Recursion is
recommended.
● When the time & efficiency of the code matters, Iteration is
recommended.
Practice Time
Q1. Write a program to print the string backwards (by both methods).

Do the following questions recursively.

Q2. Write a program to calculate ab.

Q3. Write a program to calculate HCF.

Q4. Write a program to print fibonacci series.

You might also like