Recursion is a method which breaks the problem into smaller sub problems and calls itself for each of the problems. That is, it simply means function calling itself. We can use recursion instead of loops. Recursion avoids mutable state associated with loops. Recursion is quite common in functional programming and provides a natural way to describe many Algorithms. Recursion is considered as to be important in functional programming. Scala supports Recursion very well.
Let us understand using the simple factorial example.
The above code demonstrated in a recursive approach to a factorial function, where the condition n == 1 results in a break from the recursion.
Let us understand more clearly by an example of gcd.
Problem with recursion is that deep recursion can blow up the stack if we are not careful.
Let’s understand this by using an example:
The method sum will do the summation of all the numbers. We reduce the num everytime and add it to the result. Here, whenever we call sum, it will leave input value num on the stack and using up memory every time. when we try passing a large input like sum(555555) than the output will be java.lang.StackOverflowError. This output means that the stack has been blown up.
The above example does not use tail recursion and is therefore not an optimal approach, especially if the starting value n is very large.
The tail recursive functions considered better than non tail recursive functions as tail-recursion can be optimized by compiler. A recursive function is said to be tail recursive if the recursive call is the last thing done by the function. There is no need to keep record of the previous state.
Let us understand it by a example:
Here in the above code, we can use the @tailrec annotation to confirm that our algorithm is tail recursive.
If we use this annotation and our algorithm isn’t tail recursive, the compiler will complain. For instance, if we attempt to use this annotation on the above example of the factorial method, we will get the following compile-time error.
Could not optimize @tailrec annotated method factorial: it contains a recursive call not in tail position
- Tail Recursion in Scala
- Recursion in Perl
- Recursion in Ruby
- Recursion in Java
- Kotlin Recursion
- Generating subarrays using recursion
- Difference between Recursion and Iteration
- Perl | Tail Calls in Function Recursion
- Scala Tutorial – Learn Scala with Step By Step Guide
- Scala Map
- Set in Scala | Set-2
- Scala | Either
- Set in Scala | Set-1
- Scala Int >>(x: Int) method with example
- Scala Int max() method with example
- Scala Int >>>(x: Int) method with example
- ListSet in Scala
- Scala Int | (x: Int) method with example
- Scala Int ^(x: Int) method with example
- Scala Int >=(x: Int) method with example
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. 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.