nebnznsnshsjsjsjsjsjssjsjsjsjsjsjsjdjw 2.pptx
- 1. SUGGESTED BY Santoshichakraborty ma’am RECUSION OF FUCTIONS Swami Shri Swaroopanand Saraswati Mahavidyalaya Session 2023-24 PRESENTED BY PushpitaSahu MSc IV Sem
- 2. CONTENTS :- Introduction Definitionof recusion Example of recusion Application References
- 3. INTRODUCTION :- Recursion is a programming concept where a function calls itself in its own definition. It involves breaking a problem into smaller, similar subproblems and solving them.
- 4. DEFINITION OF RECUSION:- In C programming, recursion is a technique where a function calls itself either directly or indirectly to solve a smaller instance of the same problem. It involves breaking down a complex problem into simpler subproblems and solving them iteratively. Recursion typically consists of two parts Base Case: It is the simplest form of the problem that can be directly solved without further recursion. The recursive function checks for this base case to stop the recursion. Recursive Case: It involves breaking down the original problem into smaller, similar subproblems and solving each of them by making recursive calls to the same function. Here's a simple example of a recursive function in C:
- 5. EXAMPLE OFRECUSION :- /*Write a program to find factorial by using recusion #include <stdio.h> long int factorial(int n); void main() { int n, result; printf("Enter a number: "); scanf("%d", &n); result = factorial(n);
- 6. printf("The factorial of %d is %ld", n, result); getch(); } int factorial(int n) { Long int fact; if ( n = = 1) { return 1; } else { fact =n * factorial(n - 1); return(fact); } }
- 7. APPLICATION:- Application or use of recursion Mathematical Calculations: Recursion is often used for mathematical calculations, such as calculating factorials, Fibonacci numbers, and combinations. Tree and Graph Traversals: Recursive algorithms are efficient for traversing tree structures or graphs. Dynamic Programming: Recursion is a key concept in dynamic programming, where a complex problem is broken down into simpler subproblems, and solutions to subproblems are cached for efficiency.
- 8. REFERENCE:- Programming In ANSI C E. Balagurusamy
- 9. THANK YOU!