Scribd
Upload
33 views

Recursion in C: 1. #Include

Recursion is a process where a function calls itself repeatedly to solve a problem. In C, recursion involves function calls where a function calls itself. It is important to define a termination condition to stop recursion. While recursion code can be shorter, iterative solutions are generally more efficient. Recursion is well-suited for problems like sorting, searching, traversal, calculating factorials, and finding Fibonacci numbers.

Uploaded by

karthik gunda
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
33 views

Recursion in C: 1. #Include

Recursion is a process where a function calls itself repeatedly to solve a problem. In C, recursion involves function calls where a function calls itself. It is important to define a termination condition to stop recursion. While recursion code can be shorter, iterative solutions are generally more efficient. Recursion is well-suited for problems like sorting, searching, traversal, calculating factorials, and finding Fibonacci numbers.

Uploaded by

karthik gunda
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 5

Recursion in C

Recursion is the process which comes into existence when a function calls a copy of itself to work
on a smaller problem. Any function which calls itself is called recursive function, and such
function calls are called recursive calls. Recursion involves several numbers of recursive calls.
However, it is important to impose a termination condition of recursion. Recursion code is
shorter than iterative code however it is difficult to understand.
Recursion cannot be applied to all the problem, but it is more useful for the tasks that can be
defined in terms of similar subtasks. For Example, recursion may be applied to sorting, searching,
and traversal problems.
Generally, iterative solutions are more efficient than recursion since function call is always
overhead. Any problem that can be solved recursively, can also be solved iteratively. However,
some problems are best suited to be solved by the recursion, for example, tower of Hanoi,
Fibonacci series, factorial finding, etc.
In the following example, recursion is used to calculate the factorial of a number.

1. #include <stdio.h>
2. int fact (int);
3. int main()
4. {
5. int n,f;
6. printf("Enter the number whose factorial you want to calculate?");
7. scanf("%d",&n);
8. f = fact(n);
9. printf("factorial = %d",f);
10. }
11. int fact(int n)
12. {
13. if (n==0)
14. {
15. return 0;
16. }
17. else if ( n == 1)
18. {
19. return 1;
20. }
21. else
22. {
23. return n*fact(n-1);
24. }
25. }
Output

We can understand the above program of the recursive method call by the figure given below:

Recursive Function
A recursive function performs the tasks by dividing it into the subtasks. There is a termination
condition defined in the function which is satisfied by some specific subtask. After this, the
recursion stops and the final result is returned from the function.
The case at which the function doesn't recur is called the base case whereas the instances where
the function keeps calling itself to perform a subtask, is called the recursive case. All the recursive
functions can be written using this format.
Pseudocode for writing any recursive function is given below.

26. if (test_for_base)
27. {
28. return some_value;
29. }
30. else if (test_for_another_base)
31. {
32. return some_another_value;
33. }
34. else
35. {
36. // Statements;
37. recursive call;
38. }

Example of recursion in C
Let's see an example to find the nth term of the Fibonacci series.

39. #include<stdio.h>
40. int fibonacci(int);
41. void main ()
42. {
43. int n,f;
44. printf("Enter the value of n?");
45. scanf("%d",&n);
46. f = fibonacci(n);
47. printf("%d",f);
48. }
49. int fibonacci (int n)
50. {
51. if (n==0)
52. {
53. return 0;
54. }
55. else if (n == 1)
56. {
57. return 1;
58. }
59. else
60. {
61. return fibonacci(n-1)+fibonacci(n-2);
62. }
63. }
Output

Memory allocation of Recursive method


Each recursive call creates a new copy of that method in the memory. Once some data is returned
by the method, the copy is removed from the memory. Since all the variables and other stuff
declared inside function get stored in the stack, therefore a separate stack is maintained at each
recursive call. Once the value is returned from the corresponding function, the stack gets
destroyed. Recursion involves so much complexity in resolving and tracking the values at each
recursive call. Therefore we need to maintain the stack and track the values of the variables
defined in the stack.
Let us consider the following example to understand the memory allocation of the recursive
functions.

64. int display (int n)


65. {
66. if(n == 0)
67. return 0; // terminating condition
68. else
69. {
70. printf("%d",n);
71. return display(n-1); // recursive call
72. }
73. }
Explanation
Let us examine this recursive function for n = 4. First, all the stacks are maintained which prints
the corresponding value of n until n becomes 0, Once the termination condition is reached, the
stacks get destroyed one by one by returning 0 to its calling stack. Consider the following image
for more information regarding the stack trace for the recursive functions.

You might also like