Throughout the chapter, I have conveniently skipped over the complexity analysis of the algorithms I have discussed. This was to ensure that you grasp the concepts of functional programming before being distracted by something else. Now is the time to get back to it.

Analyzing the complexity of a recursive algorithm involves first creating an equation. This is naturally the case because the function is defined in terms of itself for a smaller input, and the complexity is also expressed as a function of itself being calculated for a smaller input.

For example, let's say we are trying to find the complexity of the foldLeft operation. The foldLeft operation is actually two operations, the first one being a fixed operation on the current initial value and the head of the list, and then a foldLeft operation on the tail. Suppose T(n) represents the time taken to run a foldLeft operation on a list of length n. Now, let's assume that the fixed operation...