In this tutorial we will learn Kotlin Recursive function. Like other programming languages, we can use recursion in Kotlin.
A function which calls itself is called as recursive function and this process of repetition is called recursion.
Whenever a function is called then there are two possibilities –
- Normal function call
- Recursive function call
Normal function call
When a function is called from
main() block then it is called a normal function call. In below example,
sum() is called at a time and it executes its instruction and terminate with returning the sum of number. If we want to execute the function again then we should call
sum() from the main block one more time.
Calling sum() function from main() block –
Recursive Function Call
When a function calls itself then it is called recursive function call. Every recursive function should have terminate condition else program executions enters in infinite loop and results into stack overflow error.
Calling callMe() function from its own block –
Here, we have used terminate condition
if( a > 0) else it enters the infinite loop. And it prints the value from 5 down to 0.
Example 1: Find the factorial of a number without using terminate condition
Exception in thread "main" java.lang.StackOverflowError
Example 2: Find the factorial of a number with using terminate condition.
Factorial of 5 is: 120
Working of factorial program –
The recursive call of Fact() is explained step by step in the following figure:-
Example 3: Find the sum of elements of an array using recursion
The sum of array elements is: 55
Here, we have initialized an array and passed as an argument to the sum() function. In each recursive call the index value decrement by one. If the index equal to zero or less than then terminate it and return the sum of all the elements.
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to email@example.com. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.