BinaryFib(6)

BinaryFib(5) BinaryFib(4)

BinaryFib(4) BinaryFib(3) BinaryFib(3) BinaryFib(2)

BinaryFib(3) BinaryFib(2) BinaryFib(2) BinaryFib(1) BinaryFib(2) BinaryFib(1) BinaryFib(1) BinaryFib(0)

LinearFib(6)
F[]=8,5

F[]=5,3
LinearFib(5)

F[]=3,2
LinearFib(4)

F[]=2,1
LinearFib(3)

F[]=1,1
LinearFib(2)

F[]=1,0

LinearFib(1)
ReverseArray(A,i,j) IterativeReverseArray(A,i,j)

Java Method: Java Method:

if i<j { for (int i=0;i<A.length-1;i++){

A[i]=A[j]; if i<j {

ReverseArray(A,i+1,j-1); A[i]=A[j];

} ReverseArray(A,i+1,j-1);

P6=9

public static int recP(int n){

recP(n)=(recP(n-3)+recP(n-1))+1;

return recP(n)

P8=(P5*P7)+1

P5=(P2*P4)+1 P7=(P4*P6)+1

P4=(P1*P3)+1 P4=(P1*P3)+1

So there are four calls of recP(4) in recP(8) as shown by recursion tree

public static int iterP(int n){

for (int i=0;i<n;i++)

iterP(n)=(iterP(n-3)+iterP(n-1))+1;

return iterP(n)

}
Tlum(5,3) returns 15

Tlum(6,15) returns 90

Tlum(n,m) returns m number of times n is added to itself. It returns the product of m and n

 Drawticks (0)

 Drawticks (1)
Drawticks (0)

Drawonetick (1)

Drawticks (0)

Previous pattern repeats

 Drawticks (2)

Drawticks (1) Drawtick (0)

Drawonetick (1)

Drawonetick (1) Drawticks (0)

Drawticks (1)

Previous pattern repeats

Drawticks