1:
2:
3:
4:
5:
6:
7:
8:
9:
10:
11:
12:
13:

procedure p(n : integer) : integer;
  begin
    if n < 1 then return 1
             else return q(n div 4)
    end if
  end

procedure q(n : integer) : integer;
  begin
    if n < 1 then return 1
             else return p(n * 3)
    end if
  end

1:
2:
3:
4:
5:

T1(n) = { 1, falls n = 1
        { T2(n/4), sonst

T2(n) = { 1, falls n < 1
        { T1(n*3), sonst