Module$2$ DQ: Algorithm Analysis Metrics: Analyzing recursive algorithms

$11$

Analyzing recursive algorithms.

We used the random access machine $($RAM$)$ model to help us define the primitive operation and then to analyze the complexity of the algorithm by determining the Best, Worst, and Average cases.

We have many examples in the lectures and was easy $($ if I can say that.!$)$ to analyze. However, sometimes it is difficult or not obvious to find the Complexity for nested loops$/$function calls$/..$etc

One of these is the Recursive code.

In this Thread discuss why it is not obvious to find $/$compute the time complexity of the recursion code?

Give me an example code to support your argument.