Anatomy of a recursion
A recursive behaviour is when you can define it by two properties:
- The Base Case: The terminating scenario that does not need to recurse anymore in order to produce an answer.
- A set of rules that reduce all the other cases toward the base case.
Let’s mark with some comments all the base cases from our previous examples to make this even more clear:
As a note, is nice to mention the funny quote from Andrew Plotkin about recursions:
If you already know what recursion is, just remember the answer. Otherwise, find someone who is standing closer to Douglas Hofstadter than you are; then ask him or her what recursion is.
Finding land on Civilization 3
To conclude this workshop on recursion, I would like to bring in a Toy Problem about matrix traversal, so that you can get your hands dirty with some recursions.
Let’s immagine we have a matrix, representing the map of the virtual world we are going to play on in Civilization 3.
We want to start our game on the vastest territory possible to increase the fun, and be able in to just quite and restart a new game in case the territory we were radnomly given at the beginning of our game is too small to have some reasonable amount of fun within it.
To do that we’ll need to define a function
continentCounter that accept a world matrix, and xy coordinates as parameters. ContinentCounter will returns the number of ‘tiles’ that the land on the given coordinates x and y is comprised of, or 0 in case of water.
Land is defined as the continuos walkable surface not crossed by water.
- Implement continentCounter() using a recursive process.
- Identify which kind of recursive process your implementation of continentCounter() generates.
The Civilization problem was given to me during a workshop on recursion that I attended as part of the Advanced Software Engineering Immersive program taught at Hackreactor. The worskhopp was given by the awesome Ilona Budapesti, and the problem has been taken from Chris Pine’s great introductory Ruby book and ported to JS by her. You can find the solution to the problem here.
The recursive processes are inspired by the Wizard Book: Hal Abelson’s, Jerry Sussman’s and Julie Sussman’s Structure and Interpretation of Computer Programs (MIT Press, 1984; ISBN 0-262-01077-1), an excellent computer science text used in introductory courses at MIT. So called because of the wizard on the jacket. One of the bibles of the LISP/Scheme world. Also, less commonly, known as the Purple Book.
Ecmascript 6 Tail call optmization are explained very well on Kyle Owen’s post “S6 Tail Call Optimization Explained”, an awesome HR alumnus that also happen to read and appreciate the purple book.