Course Content

  • recursion

Course Content


In C programming, it is permissible for a function to call itself. A recursive function is one that repeatedly invokes itself, either directly or indirectly, until a stated condition is met. Self-calling expressions define a recursive function, which is defined in terms of itself.

The factorial is a simple recursive function in which an integer is multiplied by itself while being incrementally reduced. Many additional self-referencing functions in a loop, such as n = n + 1 given an operational range, could be dubbed recursive functions.

Recursion is the process of a function calling itself an arbitrary number of times. A recursive call of the function is when a programme allows the user to call a function inside another function recursively.

A recursive function is a routine that calls itself directly or indirectly in programming language. Certain problems can be solved quickly using the recursive algorithm.

When a function in C calls a copy of itself, this is referred to as recursion. To put it another way, when a function calls itself, this is referred to as recursion. The function is also referred to as a recursive function. When employing recursion in your software, you must exercise greater caution.

Recommended Courses

Share With Friend

Have a friend to whom you would want to share this course?

Download LearnVern App

App Preview Image
App QR Code Image
Code Scan or Download the app
Google Play Store
Apple App Store
598K+ Downloads
App Download Section Circle 1
4.57 Avg. Ratings
App Download Section Circle 2
15K+ Reviews
App Download Section Circle 3
  • Learn anywhere on the go
  • Get regular updates about your enrolled or new courses
  • Share content with your friends
  • Evaluate your progress through practice tests
  • No internet connection needed
  • Enroll for the webinar and join at the time of the webinar from anywhere