C Recursion

 C Recursion

When a function calls itself, it is called Recursion in C Language. In another sense, with Recursion, a defined function can call itself. Recursion is a programming approach, which makes code efficient and reduces LOC.

The following figure demonstrates how recursion works when we calculate Factorial in C with Recursion:

Recursion Example in C Language

Let us now see how to find the factorial of a number in C language with Recursion:

#include <stdio.h> int main() { int res = factFunc(7); printf("Factorial = %d", res); return 0; } int factFunc(int n) { if (n >= 1) { return n*factFunc(n-1); // Recursive Calls } else { return 1; // Factorial 0 is 1 } }
Output

Factorial = 5040



If you liked the tutorial, spread the word and share the link and our website LANGUAGE CODING with others.