Recursion is a great tool to have as a programmer if you know what the hell it does. I have read my fair share of explanations so let me take a stab at this topic that continues to screw people over, including myself.
Before I get into my example I first want to say that the best way to learn difficult topics is to practice coding exercises that deal with them. Yes, I am talking about practice as Allen Iverson would say. Take advantage of sites such as HackerRank, CodeWars, and/or CodeFights to get the most out of your programming acumen.
I am now going to do something that has not been done in the history or programming. I am going to use an example of recursion that does not involve the Fibonacci sequence or factorials. Oh hell naw! Instead, the example I want to use is of a program that goes through an object and counts how many strings are in each object, including nested objects. The answer I will give is one way of solving this problem, you may come up with a different solution and I hope you do!
Let’s take a look at an example call for this function:
Let’s not use recursion at this point and just solve the problem the good ole’ iterative way. To iterate over an object we can use the for…in or for…of but I want to use the Object.keys().forEach() function instead, just to mix things up. Let’s create the stringCount function while also declaring a count so that we can keep track of the string values in the object.
Note: I will be using ES6’s let in this example. In some environments you may not be able to use this outside of strict mode, therefore, you will need use strict at the top of your file.
If you call this function with the current example you should get 1 returned because only the first property, name, has a string value that we can iterate over. Easy enough, right? You iterate through the entire object and increase the counter when you encounter, no pun intended, a string.
But as you can tell this only works for an object with a depth of 1. All other objects get ignored and we get infuriated because we know we have to now use recursion!
Before we go further let’s point out two things. One, we are using a loop to go through all the values in the object. That means we know that the loop will end at some point. We don’t have to worry about going into an infinite loop. In some recursion examples, you will hear about a base case that breaks out of a recursive function. Well, for us, it’s the forEach method that is going to do it.
Second, we see the stringCount function returns a count at the end. This is important because when we use recursion it is this value that we need to keep track of the total count. We also know it will always be returned by stringCount.
Now let’s use recursion to iterate over the values in the array that has the names of my friends. What do I need to do? I need to call the function again passing in the array value. But what will that do? That will call the function and look to iterate over the values. Currently, we are using a method that iterates over object literals, not arrays. What we need to do now is provide an if statement for iterating other both an object literal and array. Let me show you how I did this.
Now let’s get into what’s happening. I first check for the type of object that is being passed to stringCount. If the object is an object literal it’s executed in the first if statement. If it’s an array it’s executed in the second. When we passed in the object literal the first time, the first if statement is executed. It iterates over all values checking to see if the value is a string. If the value is a string, I increase the counter. If the value is an array, I call the function and pass it the array.
Now the tricky part. You see I am using count+= stringCount(object[key]). Remember I mentioned before that stringCount will always return count when it finishes executing. If there are no strings it returns 0, if 1, it returns 1. Secondly, as I said before, we are iterating over the object and the array using a loop. We know the loop will end and when it does we will get a count returned. We then take that value, stringCount(object[key]), and add it to count when it’s done executing. Neat, huh?
Now you see the power of recursion and anytime you need to count strings in an object or array you know where to go! Apologies to those who want me to solve the entire problem, but I will not go further with the current example. Instead, I leave it as a ‘fun’ activity for you to work on. I recommend that you try other solutions but please don’t spoil it for others!
I hope this post was helpful and maybe opened up your eyes to the wonderful world of recursion. It’s not so bad once you get past factorials and Fibonacci sequences!