Wrapping Up
We’ve reached the end of another chapter! You’ve learned that recursive functions are the core of repetition in functional programming. Recursion is a big subject. Let’s see what we’ve covered:
-
We created recursive functions to solve tasks that need repetition.
-
We transformed a collection of data into a new one using recursion.
-
We studied the decrease-and-conquer and divide-and-conquer strategies of solving problems.
-
We saw how to avoid performance problems using tail-recursive functions.
-
We covered strategies to work with unbounded recursion.
-
We saw how named functions are simpler than anonymous functions when working with recursion.
With this knowledge, we can face almost any problem that requires a repetition task using functional ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Read now
Unlock full access