C Tutorial

C Tutorial C Language Environment Setup Execution flow of C program C printf and Scanf C Data type C Token Variable in C Operators in C Comments in C Escape Sequence in C C – Storage Classes C Decision control statement Loop Statement in C Break, continue and goto statement in C Type Casting in C Function in C Recursion in C String in C C Array Pointer in C Dynamic memory allocation C –Structure Nested Structure in C Union in C File Handling in C C pre-processor Static Function In C Sizeof In C Selection Sort In C Scope Of Variables In C Runtime Vs Compile Time In C Random Access Lseek In C Queue Implementation In C Pseudo Code In C Prototype In C Pointer To Pointer In C Pointer Arithmetic In C Passing Array To Function In C Null Character In C Merge Sort In C Macros In C Library Functions In C Memory Leak In C Int In C Goto And Labels In C Fibonacci Series In C Fflush In C Derived Data Types In C Data Types In C Const Vs Volatile In C Character Set In C Character Class Tests In C Calloc In C C Pointers Arrays In C Include In C Clrscr In C C Vs Java String Literals In C Types Of Pointers In C Variables In C Volatile In C Why C Is A Middle Level Language Infix To Postfix Program In C Ceil function in C LCM of two numbers in C Quick sort in C Static in C function pointer as argument in C Top Array Keywords in C Add two numbers using the function in C Armstrong program in C using function Array, Declaring Arrays and Array Initialization Limitations of Inline Function in C Merge and Merge sort with example in C Do-While Loop in C For Loop in C While-Loop in C Difference between while and do-while loop in C Array Of Structures in C Data Structures And Algorithms in C Types Of Structures In C How to Avoid Structure Padding in C Use of Structure in C Do WHILE LOOP in C Programming Examples For Loop in C Programming Examples Entry Control Loop in C Exit control loop in C Infinite loop in C Nested loop in C pow() function in C String Handling functions in C Prime Number code in C Factorial Program in C using For Loop Factorial Program in C Using While Loop Fibonacci Series in C Using For Loop Fibonacci series in C using while loop Prime Number Program in C using for Loop While Loop in C programming examples Built-in functions in C Assert() Function C vs Java Strings Call Back Function in Embedded C Else If Ladder fgets() function Ftell() Function getc() function getch() function gets() function Heap Sort Nested if-else statement Pi() Function Positioning of file Write() function abs() function in C Attributes in C C program to find factorial of a number using Recursion Ferror() in c fopen() function in C Fibonacci series program in C using Recursion Formatted Input and output function in C Snake Game in C User Defined Functions in C Beep() function in C Cbrt() function in C Hook() function in C Isalnum() function in C C Program to find the Roots of a Quadratic Equation C Switch Statements Difference between rand() and srand() function in C Difference between while and for loop in C Doubly Linked list in C Example of Iteration in C How to use atoi() function in C How to use floor() function in C How to use sine() function in C How to use Typedef Struct in C Integer Promotions in C C Program Swap Numbers in cyclic order Using Call by Reference C Program to Find Largest Number Using Dynamic Memory Allocation C Program to Find the Largest Number using Ternary Operator C/C++ Program to Find the Size of int, float, double and char Find the Largest Three Distinct Elements in an Array using C/C++ Loop Questions in C Modulus on Negative Numbers in C Multiplication table program in C using For loop Nested Loops in C Programming Examples C Program for Mean and Median of an Unsorted Array Results of Comparison Operations in C and C++ Reverse a Stack using Recursion in C Simple hash() function in C strcat() Function in C Sum of N numbers in C using For loop Use of free() function in C Write a program that produces different results in C and C++ C Function Argument and Return Values Keywords in C Bank management system in C Calendar application in C Floor() Function in C Free() Function in C How to delete a file in C How to move a text in C Remove an element from an array in C Unformatted input() and output() function in C What are linker and loader in C SJF Scheduling Program in C Socket Programming in C Structure in C Tower of Hanoi in C Union Program in C Variable Declaration in C What is Linked List in C While Loop Syntax in C fork() in C GCD program in C Branching Statements in C Comma Operator in C Control statement in C Double Specifier in C How to create a binary file in C Long int in C Palindrome Number in C Pure Virtual Function in C Run Time Polymorphism in C Types of Array in C Types of Function in C What is a buffer in C What is required in each C Program Associativity of Operators in C Bit Stuffing Program in C Actual and Formal Parameters Addition of two Numbers in C Advantages of function in C Arithmetic Progression Program in C Binomial Coefficient Program in C Difference between Array and List in C Diffie-Hellman Algorithm in C How to convert a number to words in C How to convert a string to hexadecimal in C Difference between If and Switch Statement in C C and C++ Binary Files C program that does not Suspend when Ctrl+Z is Pressed Different ways to Declare the Variable as Constant in C Range of Int in C C Program to find the size of a File FIFO Example in the C Language For loop in C Programming GCD program of two numbers in C GPA Calculator in C How to Calculate Time Complexity in C How to include graphics.h in C How to measure time taken by a function in C How to return a Pointer from a Function in C What is the main in C Addition of Matrix in C Booleans in C C Program for Extended Euclidean algorithms C Program of Fencing the Ground Ceil and Floor in C Compound Interest Program in C Displaying Array in C Distance Vector Routing Protocol Program in c Dos.h Header File in C Language DSA Program in C Explain the two-way selection in C Fee Management System in C File Operations in C Malloc function in C Multiplication Table in C Simple Programs in C Language tolower() Function in C Type Conversion in the C Why does sizeof(x++) not Increment x in C Advantages of Dynamic Memory Allocation in C Armstrong Number in C Assignment Operator Program in C Banker’s Algorithm in C Binary Search in C with Best and Worst Time Complexity Caesar Cipher Program in C Call by Value and Call by Reference in C Conditional Operator in C CRC Program in C Deadlock Detection Program in C Decimal to Binary in C Difference between If Else and Nested If Else in C Difference between Pre-increment and Post-increment in C Difference between Scope and Lifetime in C Evaluation of Arithmetic Expression in C Explain the Increment and Decrement Operators in C Fseek Function in C Functions in C How to Find Square Free Numbers in C Length of an Array Function in C OpenGL in C Projects on C language in 2023 Purpose of a Function Prototype in C Stdio.h in C Two-Dimensional array in C What is String Comparison in C C Compilers for Windows Functions and Recursion in C How to Declare Boolean in C How to Declare Character in C How to Round up a number in C How to use strlen() in C Pointer Declaration in C Algorithm for String Palindrome in C C Program to find ASCII value of a character Constant Pointer in C How to find string length in C using strlen() function Implicit and Explicit in C Indirect Recursion in C Input and Output functions in C isupper() in C Jump Statement in C Lifetime of a Variable in C Linker Error in C Language Numeric Constant in C Size of Pointer in C Square Root in C Language Static and Dynamic Memory allocation String Declaration in C Strong Number in C Symmetric Matrix in C Types of C Tokens What is a Size of Pointer in C What is Increment and Decrement Operator in C 1 2 3 4 Series Program in C Advantages and Disadvantages of C Language C Program for Polynomial Addition C Program to Count the Number of Vowels in a String C Programming Errors and Solutions Compilation Errors in C Complex C Programs Difference between Argument and Parameter in C Difference between char s[] and char *s in C Evaluation of Postfix Expression Using Stack in C Find Leftmost and Rightmost Set Bit of a Number fprintf and fscanf in C Introduction to Dynamic Array in C Print Address in C Realloc function in C Ternary Operators in C Types of Tokens in C with Examples Difference between Static and Dynamic Memory Allocation in C Addition Program in C Array Definition in C Array of Pointers in C Arrow Operator in C Average of Two Numbers in C Binary to Decimal in C Binary to Octal in C BREAK STATEMENT in C C Programming Operators Questions C Programs Asked in Interview Calculator Program in C C Program to Read and Print an Employee's Detail Using Structure Bubble Sort Algorithm in C C Program to Find Area and Perimeter of Circle C Program to Check Whether a Given Number is Even or Odd C in Roman Numerals C Program to Make a Simple Calculator Using Switch Case Insertion Sort Program in C How to take input in string in C GCC Conflicting Types in C Function Definition in C Format Specifier for Hexadecimal in C Flowchart in C Float in C Fizzbuzz Implementation in C Conditional Statement in C Conio.h functions list in C Constants in C Dynamic Array in C Decision Making Statements in C Continue Statement in C Creation of Thread in C DFS Algorithm in C Difference between parameter and arguments in C Dijkstra's Algorithm in C Leap Year Program in C Jump Statements in C Modulus Operator in C Memory Allocation in C Simple Interest Program in C Reverse Array in C Recursive Function in C Queue in C Printing Pascal’s Triangle in C Preprocessor Directives in C Perror() in C Perfect Number in C Programming Language Parameter Passing Techniques in C Pascal Triangle in C Patterm Program in C Affine cipher in C Dereferencing pointer in C Internal static variable vs External static variables in C Difference between exit(0) and exit(1) in C Booth's Algorithm in C Condition Control Statements in C Double Specifier in C Dynamic variables in C How to print alphabets in C How to print char array in c Order of Evaluation in C Order of Operations in C Semantic Error in C Size of String Variable in C SJF PREEMPTIVE SCHEDULING PROGRAM C: Tree in C Arithmetic Progression Program in C Array, Declaring Arrays, and Array Initialization ARRAYS IN C Assert() Function in c Atoi in C Bar3d() function in C Graphics Beep function in c Bigint (BIG INTEGERS) in C with Example Builtin functions of GCC compiler Fibonacci series in C Priority Queue in C 2D ARRAY IN C 7 Best IDEs for C/C++ Developers in 2022 Addition of Two Numbers in C Advantages and Disadvantages of C Language Advantages of Function in C Algorithm for String Palindrome in C What is fgets in C language 2d Shearing Program in C Recursion Questions In C Static Identifier in C Inserting elements in an array using C Language

Recursive Function in C

Recursion is ordinary and calls itself repeatedly without delay or directly.

There are two varieties of Recursion in C - Direct and Indirect. The calling refers back to the recursive name.

The Recursion is viable in C language using approach and feature. The troubles like the Tower of Hanoi, the Fibonacci collection, and the nth by-product may be solved by Recursion.

Scope of the Article:

  1. In this newsletter, we've protected Recursion and its types.
  2. The article is instance-orientated, with step-through-step clarification of every instance.
  3.  The article explains the reminiscence allocation of Recursion in conjunction with its blessings and downsides.

What is Recursion in C?

Recursion, in preference, can be described because of the repetition of a method in a comparable way until the precise situation reaches.

In C Programming, if a feature calls itself from the inner, the same characteristic is called Recursion.

The characteristic which calls itself is referred to as a recursive characteristic, and the function name is named a recursive call.

The Recursion is just like a new release but extra complicated to recognize. If the trouble can be solved with Recursion's aid, it could be solved utilizing generation. Recursion may solve problems like sorting, traversal, and looking.

While using Recursion, ensure it has a base (exit) situation; otherwise, this system will go into the endless loop.

The Recursion contains two instances in its software frame.

1. Base case:

  1. When you write a recursive technique or function, it continues calling itself, so the bottom case is a specific state of affairs inside the feature.
  2. When its miles meet, it terminates the Recursion.
  3. It is used to make sure that this device will terminate.
  4. Otherwise, it is going into an endless loop.

2. Recursive case:

The part of code in the recursive function carried out repeatedly while calling the recursive feature is called the recursive case.

The basic syntax of Recursion:

void recursive_fun() //recursive function
{
 Base_case; // Stopping Condition
 recursive_fun(); //recursive call
}
int main()
{
 recursive_fun(); //function call
}

The function call within the critical function is a fashionable name; it calls the recursive_fun() function interior, which there may be very different function name recursive_fun(); it is termed a recursive call, and the whole recursive_fun() feature is a recursive feature. Base_case is the preventing situation for the recursive characteristic.

Flowchart of Recursion:

In the next photo, there may be a recursive characteristic inner, which may be a recursive call that calls the recursive feature until the hassle situation is actual. If the situation is satisfied, the circumstance is fake, and this system manager goes for the final statements and stops the program.

RECURSIVE FUNCTION IN C

And this is the Flowchart of RECURSION.

How does Recursion Work?

The Recursion will be available using a way or function in C language. The recursive feature or method has predominant parts in its body, i.e., the bottom and the recursive cases.

While the recursive technique is accomplished, the bottom case is checked through this system first. If it turns out proper, the expected returns and quits; in any other case, the recursive case is achieved. Inside the recursive case, we've got a recursive name that calls the featured interior, which is a miles gift.

Why Stack Overflow occurs in Recursion?

 When the bottom case isn't always reached because of a wrong definition or the lowest case isn't always defined, it could lead to stack overflow mistakes because the stack area or reminiscence can be full of recursion calls.

int fibo(int n) {
 if (n == 1000)
 return 0;
 return fibo(n - 1) + fibo(n - 2);
}

So, if we skip the feature with a rate much less than a thousand, we will not attain any base circumstance, foremost to stack overflow mistakes.

Types of Recursion in C:

We can observe two types of Recursion in the C language.

1. Direct Recursion

2. Indirect Recursion

Difference between Direct and Indirect Recursion:

When the calling characteristic in Recursion calls the equal function itself, it is called direct Recursion. In the case of indirect Recursion, one characteristic call some other feature directly or circuitously.

Below is the instance for both:-

// An example of direct Recursion
void directRecursion()
{
 directRecFun();
}
// An example of indirect Recursion
void indirectRecursion1()
{
 indirectRecFun2();
}
void indirectRecursion2()
{
 indirectRecFun1();
}

C Program Function to show Direct Recursion:

#include<stdio.h>
int fibonacci_01(int i) {
 if (i == 0) {
 return 0;
 }
 if (i == 1) {
 return 1;
 }
 return fibonacci_01(i - 1) + fibonacci_01(i - 2);
}
int main() {
 int i, n;
 printf("Enter a digit for fibonacci series: ");
 scanf("%d", & n);
 for (i = 0; i < n; i++) {
 printf(" %d ", fibonacci_01(i));
 }
 return 0;
}

OUTPUT:

RECURSIVE FUNCTION IN C

In the C software above, we've declared a characteristic named fibonacci_01(). It takes an integer when an input returns to the ith detail of the Fibonacci collection. At first, the principle() function might be accomplished by taking two variables, i and n.

C Program Function to reveal Indirect Recursion:

Here is a C software to print numbers from 1 to ten so that we can print that amount plus 1 when a strange no is encountered.

When an excellent range is encountered, we might print that wide variety minus one and could increment the modern-day wide variety at each step.

We will take enter from the person so that it will be saved in n, and the for loop will execute until n new release where with every iteration, it will bypass the parameter to fibonacci_01() feature in which the familiar feel for the Fibonacci collection is written.

Now indoors fibonacci_01() function, we've got nested if-else. If input = 0, it'll return to 0; These are the base instances for the Fibonacci function. If the price of i is extra than 1, then Fibonacci (i) will skip decreasing lower back fibonacci_01 (i - 1) fibonacci_01 (i -2) recursively, and this Recursion is probably computed until the lowest scenario.

#include<stdio.h>
void add();
void even();
int n=1;
void odd()
{
 if(n <= 10)
 {
 printf("%d ", n+1);
 n++;
 even();
 }
 return;
}
void even()
{
 if(n <= 10)
 {
 printf("%d ", n-1);
 n++;
 odd();
 }
 return;
}
int main()
{
 odd();
}

OUTPUT:

RECURSIVE FUNCTION IN C

This C software program has functions named bizarre() or even.

Then the n fee is incremented by using 1(it will become even), and the even() feature is referred to as. Now inside the event () feature, we again have an if announcement, which states that if the cost of n is much less than or equals 10, subtract one from it and print.

Then the n fee is incremented using 1(it becomes peculiar, and the atypical() feature is called. This indirect Recursion continues until the circumstance internal to each function becomes unhappy. Remaining, we have the main() characteristic internal, which we name the peculiar() feature as the first number taken care of is 1, which is abnormal.

Now let's simulate this software using stack and the idea referred to as activation report via which we ought to song application good judgment regarding application stack.

SUM of Natural numbers using Recursion:

#include <stdio.h>
int sum(int a);
int main() {
 int num, x;
 printf("Enter a number: ");
 scanf("%d", &num);
 x = sum(num);
 printf("sum of natural number = %d", x);
 return 0;
}
int sum(int a) {
 if (a != 0)
 return a + sum(a-1); //sum() calls itself
 else
 return a;
}
RECURSIVE FUNCTION IN C

ADVANTAGES AND DISADVANTAGES OF RECURSION:

Advantages:

  1. The code turns shorter and decreases the unnecessary calling to capabilities.
  2. Helpful in fixing method-based troubles and complicated algorithms.
  3. They are helpful in Graph and Tree traversal as they're inherently recursive.
  4. Recursion allows us to divide the problem into sub-issues and resolve them, basically dividing and overcoming.

Disadvantages:

  1. The code becomes tough to apprehend and examine.
  2. A lot of memory is used to preserve the copies of recursive functions within the memory.
  3. Time and Space complexity is improved.
  4. Recursion is commonly slower than a new release.

CONCLUSION:

  • There are two varieties of Recursion in the C language. The first is Direct Recursion, and the second is Indirect Recursion.
  • The Direct Recursion in C occurs when a function calls itself at once from the inner.
  • Indirect Recursion occurs when a feature calls another feature, and then that characteristic calls the first characteristic again.
  • The feature calls to itself is a recursive call, and the feature will become a recursive characteristic.
  • The stack is maintained in the reminiscence to store the recursive calls and all the variables with the cost exceeded in them.