In tail recursion, a recursive call is executed at the end of the function. What is the difference between tailed and non-tailed recursion? Interview Questioned asked about recursion These are the different types of recursion in C. It is the opposite of primitive type recursion. If there is a function which cannot be defined without recursion, is called as general recursion. In this type of recursion, a function calls another function, which eventually calls the original function. There are two or more functions involved in this type of recursion. Recursion can be either single or multiple type. It is just the opposite of a single recursion. Multiple RecursionĪs by its name, it is the types of recursion when there are multiple recursive calls in the function. It is the types of recursion when there is only one recursive call in the function. In the above Fibonacci example, the recursive function is executed as the last statement of the ‘fibo’ function. It is a primitive recursion in which the recursive call is present as the last thing in the function. We have already seen the Fibonacci series example which can be programmed with recursion as well as with loop. It is the types of recursion that can be converted into a loop. Output: Fibonacci example using recursionģ4 What are the different types of Recursion in C? 1. Printf('Fibonacci series for %d terms is: ',t) Printf('Fibonacci example using recursion ') Printf('Fibonacci series of %d terms is: ',i) Printf('Fibonacci example using loop ') It uses for loop to add the last two terms in order to calculate the next term. Fibonacci C Program using LoopĪ program that generates Fibonacci series using for loop is given below. However, this logic doesn’t apply to the first two terms of the sequence.įirst two terms are initialized as 0 and 1. It is a sequence of numbers in which every next term is the sum of the previous two terms. Let us understand the concept of recursion by taking an example of the Fibonacci series. In simple terms, recursion is writing a function call in its definition.Ī function is called recursive if a statement within the body of a function calls the same function. And in programming languages, recursion means nesting of function calls. In simple English, recursion means repetition. Interview Questioned asked about recursion.What are the different types of Recursion in C?.

C recursion function