Download as pptx, pdf, or txt
Download as pptx, pdf, or txt
You are on page 1of 8

RECURSION

S
DEFINATION
The recursion process in C refers to
the process in which the program
repeats a certain section of code in a
similar way. Thus, in the
programming languages, when the
program allows the user to call any
function inside the very same
function, it is referred to as a
recursive call in that function.
TYPES OF
RECURSIONS
INDIRECT NON TAIL
DIRECT TAIL RECURSIONS
Direct recursion is the RECURSIONS
When a function is RECURSIONS
RECURSIONS Tail recursion is defined
type of recursion in mutually called by A function is called the
as a recursive function
which a function another function in a non-tail or head
in which the recursive
directly calls itself circular manner, the recursive if a function
call is the last statement
within its own block of function is called an makes a recursive call
that is executed by the
code indirect recursion itself, the recursive call
function.
will be the first
EXAMPLE
A simple program to explain
recursions
01
EXAMPL
using Recursion program for

E2
writing fibonacci series
CO N C L U S I O
N
Lorem ipsum dolor sit amet, consectetur
adipiscing elit. Suspendisse quis enim pretium,
bibendum ante ullamcorper, tincidunt augue.
Nunc sed lorem aliquam, malesuada lectus eu,
placerat lorem.
T HAN K
YOU
RESULT
Lorem ipsum dolor sit amet,
consectetur adipiscing elit.
01
Suspendisse quis enim pretium,
bibendum ante ullamcorper,
tincidunt augue.

You might also like