September 2017
Beginner to intermediate
396 pages
9h 46m
English
In the previous recipe, we saw implementation using a simple recursive definition. In this recipe, we will use a commonly found recursive function implementation pattern called worker pattern.
The list does not have random access. We have to access elements of a list sequentially to be able to do something with it. When reversing a list, we need to remember this fact.
Read now
Unlock full access