# Stack Safety, a Scala language concept

Last updated

Stack safety is present where a function cannot crash due to overflowing the limit of number of recursive calls.

This function will work for n = 5, but will not work for n = 2000 (crash with java.lang.StackOverflowError) - however there is a way to fix it :-)

In Scala Algorithms, we try to write the algorithms in a stack-safe way, where possible, so that when you use the algorithms, they will not crash on large inputs. However, stack-safe implementations are often more complex, and in some cases, overly complex, for the task at hand.

``````def sum(from: Int, until: Int): Int =
if (from == until) until else from + sum(from + 1, until)

def thisWillSucceed: Int = sum(1, 5)

def thisWillFail: Int = sum(1, 300)
``````

### A fix using Tail Recursion

In Scala, tail recursion enables you to rewrite a mutable structure such as a while-loop, into an immutable algorithm.

So, so long as you can rewrite a recursive function into an iterative function, you're good to go!

However, do not fret, there is a way to rewrite even recursive functions into stack-safe ones, called 'Defunctionalisation', which we must cover in future.

``````def sum(from: Int, until: Int): Int = {
@scala.annotation.tailrec
def rec(current: Int, sumSoFar: Int): Int = {
if (current > until) sumSoFar else rec(current + 1, sumSoFar + current)
}
rec(from, 0)
}

assert(sum(1, 5) == 15)
``````

### A fix using foldLeft and foldRight

Tail recursion can be expressed in FoldLeft-FoldRight, and vice-versa; which is better depends on how it looks in the end. It's also related to State machine

``````def sum(from: Int, until: Int): Int = { (from to until).foldLeft(0)(_ + _) }

assert(sum(1, 5) == 15)
``````

### A fix using Range

Here, we benefit from Scala's utilities that allow specialisation

``````def sum(from: Int, until: Int): Int = { (from to until).foldLeft(0)(_ + _) }

assert(sum(1, 5) == 15)
``````

### A fix using a direct formula

Ideal if you can avoid an iteration and come up with a formula that runs in O(1)

``````def sum(from: Int, until: Int): Int = { (from to until).foldLeft(0)(_ + _) }

assert(sum(1, 5) == 15)
``````

# Scala Algorithms: The most comprehensive library of algorithms in standard pure-functional Scala

## How our 100 algorithms look

1. A description/goal of the algorithm.
2. An explanation with both Scala and logical parts.
3. A proof or a derivation, where appropriate.
4. Links to Scala concepts used in this specific algorithm, also unit-tested.
5. An implementation in pure-functional immutable Scala, with efficiency in mind (for most algorithms, this is for paid subscribers only).
6. Unit tests, with a button to run them immediately in our in-browser IDE.

### Study our 100 Scala Algorithms: 6 fully free, 100 published & 0 upcoming

Fully unit-tested, with explanations and relevant concepts; new algorithms published about once a week.

### Explore the 22 most useful Scala concepts

To save you going through various tutorials, we cherry-picked the most useful Scala concepts in a consistent form.

## Subscribe to Scala Algorithms

Maximize your Scala with disciplined and consistently unit-tested solutions to 100+ algorithms.

Use it from improving your day-to-day data structures and Scala; all the way to interviewing.