I mean the special list-traversal type of tail recursion which looks something like
defp increase([head | tail]) do
[head + 1 | increase(tail)]
end
defp increase([]), do: []
This is the fastest and the most memory efficient way to traverse a list
