1) Defining recursive functions Defining recursive functions I have made up a sequence called a tribonacci sequence. The first three numbers of this sequence are 1, 2 and 3, and every subsequent number in this sequence is the sum of the previous three numbers. Thus, the sequence is 1,2,3,6,11,20,37,68,.... Write a function to compute the n th tribonacci number. Assuming the 1st number is 1. 2) Counting recursive function calls How many calls are made to tribonacci if the original call is tribonacci(5)? Solution 1.int function (int n) { if (n<3) return 1; if (n>=3) return function(n-1) + function(n-2) + function(n-3); } 2.if the call is tribfunction(5) then n>3 return( tribfunction(4)+ tribfunction(3)+ ftribunction(2)->3 calls truibfunction(4)=. tribfunction(3)+tribfunction(2)+tribfunction(1)=>3 more calls in all there will be 6 calls .

1. 1) Defining recursive functions
Defining recursive functions I have made up a sequence called a tribonacci sequence. The first
three numbers of this sequence are 1, 2 and 3, and every subsequent number in this sequence is
the sum of the previous three numbers. Thus, the sequence is 1,2,3,6,11,20,37,68,.... Write a
function to compute the n th tribonacci number. Assuming the 1st number is 1.
2) Counting recursive function calls
How many calls are made to tribonacci if the original call is tribonacci(5)?
Solution
1.int function (int n)
{ if (n<3)
return 1;
if (n>=3)
return function(n-1) + function(n-2) + function(n-3);
}
2.if the call is tribfunction(5) then
n>3
return( tribfunction(4)+ tribfunction(3)+ ftribunction(2)->3 calls
truibfunction(4)=. tribfunction(3)+tribfunction(2)+tribfunction(1)=>3 more calls
in all there will be 6 calls