Recurrence Diagram for RecursiveTrace Example

fn is an abbreviation for f(n).
Numbers shows output values.

                            f3
              _____________/  \_____________
           3  |             3              |  4
             f2                           f1
       _____/  \_____                ____/  \_____ 
    2  |     2      | 3            1 |    1      | 2
      f1           f0                f0         f-1
  ___/  \____  ___/  \___
1 |   1     |20|   0    | 1
  f0       f-1 f-1     f-2

Output: 3 2 1 1 2 2 0 0 1 3 3 1 1 2 4

Sequence of Activations, Terminations and Ouputs.

f3 Activated
Output 3
f2 Activated
Output 2
f1 Activated
Output 1
f0 Activated
f0 Terminated
Output 1
f-1 Activated
f-1 Terminated
Output 2
f1 Terminated
Output 2
f0 Activated
f0 Terminated
Output 3
f2 Terminated
Output 3
f1 Terminated
1
f0 Activated
f0 Terminated
1
f-1 Activated
f-1 Terminated
2
f1 Terminated
4
f3 Terminated