&gt; Recursion is great for algorithms that perform operations on data that can benefit from using a stack, FILO (First In Last Out). It can be faster than using loops and can make your code much simpler.<p>I can&#x27;t think of a scenario where recursion results in a faster algorithm than an iterative form. Almost always recursion makes an algorithm simple to express and understand, while the iterative form is almost certainly more performant and the expense of a little more opacity.<p>I enjoyed reading all of the Go details even if I think that the takeaway should&#x27;ve been &quot;write recursive algorithms in an iterative form if performance is a concern&quot; (in Go).