Unformatted text preview: • Determine theoretically both the number of calls and the value returned in terms of n . That is, construct two recurrence relations each describing one of these values for a general n . Use telescoping to solve these recurrence relations ( Hint : Let T ( n ) be the time complexity (frequency count) for the above algorithm and F ( n ) be the value returned by the function fun . Write a recurrence and then solve it.) • Compare printed values with the theoretical results in each case. 1...
View
Full Document
 Fall '08
 W.Szpankowski
 Recursion, function fun

Click to edit the document details