Scribd
Upload
33 views3 pages

Recursion: Number Factorial

Recursion is a process where a function calls itself directly or indirectly. In programming languages that support recursion, a recursive function contains a base case to stop the recursion and a recursive call that calls the function again. Recursive functions are useful for solving mathematical problems like calculating factorials and generating Fibonacci series by calling itself with decreasing arguments until the base case is reached. The examples demonstrate using recursive functions to calculate the factorial of a number and generate Fibonacci series.

Uploaded by

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

Recursion: Number Factorial

Recursion is a process where a function calls itself directly or indirectly. In programming languages that support recursion, a recursive function contains a base case to stop the recursion and a recursive call that calls the function again. Recursive functions are useful for solving mathematical problems like calculating factorials and generating Fibonacci series by calling itself with decreasing arguments until the base case is reached. The examples demonstrate using recursive functions to calculate the factorial of a number and generate Fibonacci series.

Uploaded by

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

RECURSION

Recursion is the process of repeating items in a self-similar way. In


programming languages, if a program allows you to call a function inside
the same function, then it is called a recursive call of the function.
void recursion() {
recursion(); /* function calls itself */
}
int main() {
recursion();
}
The C programming language supports recursion, i.e., a function to call
itself. But while using recursion, programmers need to be careful to define
an exit condition from the function, otherwise it will go into an infinite loop.
Recursive functions are very useful to solve many mathematical problems,
such as calculating the factorial of a number, generating Fibonacci series,
etc.
Number Factorial
The following example calculates the factorial of a given number using a
recursive function
#include <stdio.h>
int factorial(unsigned int i) {

if(i <= 1) {
return 1;
}
return i * factorial(i - 1);

int main() {
int i = 15;

printf("Factorial of %d is %d\n", i,
factorial(i));
return 0;
}
When the above code is compiled and executed, it produces the following
result
Factorial of 15 is 2004310016
Fibonacci Series
The following example generates the Fibonacci series for a given number
using a recursive function
#include <stdio.h>
int fibonacci(int i) {
if(i == 0) {
return 0;
}

if(i == 1) {
return 1;
}
return fibonacci(i-1) + fibonacci(i-2);

int

main() {

int i;
for (i = 0; i < 10; i++) {
printf("%d\t\n", fibonacci(i));
}
return 0;
}
When the above code is compiled and executed, it produces the following
result

13

21

34

You might also like