Hands-On Data Structures and Algorithms with JavaScript

Recursion and additive complexity

Until now, we have seen some examples that are pretty straightforward: they all have a single loop or nested loops. However, a lot of times, there will be scenarios in which we will have to handle multiple loops/function calls/branches originating from the same algorithm. Let us see an example of how we can calculate the complexity in that case?

1. When we have subsequent loops/function calls, we will need to calculate the individual complexity of each step and then add them to get the overall complexity, as follows:

            function xyz() {                    abc(); // O(n) operation                pqr(); // O(log(n)) operation            }

The collective complexity of this code would be the summation of the complexity of both the sections. So, in this case, ...